A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint

T Lorigeon (), Billaut J-C () and Bouquard J-L
Additional contact information
T Lorigeon: Université de Tours
Billaut J-C: Université de Tours
Bouquard J-L: Université de Tours

Journal of the Operational Research Society, 2002, vol. 53, issue 11, 1239-1246

Abstract: Abstract This paper studies a two-machine open shop scheduling problem with an availability constraint, ie we assume that a machine is not always available and that the processing of the interrupted job can be resumed when the machine becomes available again. We consider the makespan minimization as criterion. This problem is NP-hard. We develop a pseudo-polynomial time dynamic programming algorithm to solve the problem optimally when the machine is not available at time s>0. Then, we propose a mixed integer linear programming formulation, that allows to solve instances with up to 500 jobs optimally in less than 5 min with CPLEX solver. Finally, we show that any heuristic algorithm has a worst-case error bound of 1.

Keywords: scheduling; open shop; dynamic programming; integer programming (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601421 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:53:y:2002:i:11:d:10.1057_palgrave.jors.2601421

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601421

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().