Skip to main content
SpringerLink
Log in

Non-preemptive two-machine open shop scheduling with non-availability constraints

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract.

We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-availability intervals and present an approximation algorithm with a worst-case ratio of 4/3 for the problem with a single non-availability interval.

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. Department of Information and Technology Management, Saarland University, D-66041 Saarbrücken, Germany (e-mail: jb@itm.uni-sb.de), , , , , , DE

    J. Breit & G. Schmidt

  2. School of Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, U.K., , , , , , GB

    V. A. Strusevich

Authors
  1. J. Breit
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. A. Strusevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manuscript received: May 2002/Final version received: October 2002

RID="*"

ID="*"  Research of the first two authors was partially supported by INTAS Grant No. 96-0820

Rights and permissions

Reprints and permissions

About this article

Cite this article

Breit, J., Schmidt, G. & Strusevich, V. Non-preemptive two-machine open shop scheduling with non-availability constraints. Mathematical Methods of OR 57, 217–234 (2003). https://doi.org/10.1007/s001860200267

Download citation

  • Issue Date:

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

Search

Navigation