Mathematical Methods of Operations Research

, Volume 57, Issue 2, pp 217–234

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

  • J. Breit
  • G. Schmidt
  • V. A. Strusevich

DOI: 10.1007/s001860200267

Cite this article as:
Breit, J., Schmidt, G. & Strusevich, V. Mathematical Methods of OR (2003) 57: 217. doi:10.1007/s001860200267

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.

Key words: Open shop schedulingavailability constraintsworst-case analysis

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • J. Breit
    • 1
  • G. Schmidt
    • 1
  • V. A. Strusevich
    • 2
  1. 1.Department of Information and Technology Management, Saarland University, D-66041 Saarbrücken, Germany (e-mail: jb@itm.uni-sb.de)DE
  2. 2.School of Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, U.K.GB