On the hardness of the classical job shop problem

H. Bräsel, M. Harborth, T. Tautenhahn and P. Willenius

Annals of Operations Research, 1999, vol. 92, issue 0, 265-279

Abstract: In a classical job shop problem, n jobs have to be processed onm machines, where the machine orders of the jobs are given. Computationalexperiments show that there are huge differences in the hardness of the job shop problem tominimize makespan depending on the given machine orders. We study a partial order“ $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \succ } $$ ” on the set of sequences, i.e., feasiblecombinations of job orders and machine orders, with the property thatB $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \succ } $$ B implies thatthe makespan of the semiactive schedule corresponding to sequence B isless than or equal to the makespan of any schedule corresponding to B.The minimal sequences according to this partial order are called irreducible.We present a polynomial algorithm to decide whether B $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \succ } $$ B holds andwe develop a new enumeration algorithm for irreducible sequences. To explain the differencesin the hardness of job shop problems, we study the relation between the hardness of a jobshop problem and the number of irreducible sequences corresponding to the given machine orders. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018990932547 (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:spr:annopr:v:92:y:1999:i:0:p:265-279:10.1023/a:1018990932547

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018990932547

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().