Skip to main content
SpringerLink
Log in

Open shop unit-time scheduling problems with symmetric objective functions

  • Regular
  • Published:
4OR Aims and scope Submit manuscript

Abstract.

The paper addresses the open-shop scheduling problem with unit-time operations and nondecreasing symmetric objective function depending on job completion times. We construct two schedules, one being optimal for any symmetric convex function, the other one for any symmetric concave function. Both schedules are given by analytically defined formulas that determine in O(1) time for each operation the unit-length time slot for its processing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. University of Leeds, School of Computing, LS2 9JT, Leeds , UK

    Natalia V. Shakhlevich

Authors
  1. Natalia V. Shakhlevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Natalia V. Shakhlevich.

Additional information

Received: June 2004, Revised: January 2005,

AMS classification:

90B35, 68Q25

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shakhlevich, N.V. Open shop unit-time scheduling problems with symmetric objective functions. 4OR 3, 117–131 (2005). https://doi.org/10.1007/s10288-005-0061-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-005-0061-2

Keywords:

Search

Navigation