Skip to main content
SpringerLink
Log in

Machine scheduling with availability constraints

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems and analyze their complexity. We survey NP-hardness results, polynomial optimization and approximation algorithms. We also distinguish between on-line and off-line formulations of the problems. Results are concerned with criteria on completion times and due dates.

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. LIMOS, Universite Blaise Pascal, F-63177 Aubiere Cedex, France (e-mail: sanlavil@ucfma.univ-bpclermont.fr) , , , , , , FR

    Eric Sanlaville

  2. Information and Technology Management, University of Saarland, D-66041 Saarbrücken, Germany (e-mail: gs@itm.uni-sb.de) , , , , , , DE

    Günter Schmidt

Authors
  1. Eric Sanlaville
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Günter Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 4 July 1997 / 11 March 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sanlaville, E., Schmidt, G. Machine scheduling with availability constraints. Acta Informatica 35, 795–811 (1998). https://doi.org/10.1007/s002360050143

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050143

Keywords

Search

Navigation