Mathematical Methods of Operations Research

, Volume 57, Issue 2, pp 217-234

First online:

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

  • J. BreitAffiliated withDepartment of Information and Technology Management, Saarland University, D-66041 Saarbrücken, Germany (e-mail: jb@itm.uni-sb.de)
  • , G. SchmidtAffiliated withDepartment of Information and Technology Management, Saarland University, D-66041 Saarbrücken, Germany (e-mail: jb@itm.uni-sb.de)
  • , V. A. StrusevichAffiliated withSchool of Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, U.K.

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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 scheduling availability constraints worst-case analysis