A concise survey of efficiently solvable special cases of the permutation flow-shop problem

Monma, Clyde L.; Kan, A. H. G. Rinnooy

doi:10.1051/ro/1983170201051

Cited by 56 publications

(23 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nabeshima and Szwarc both contributed substantially to this area with numerous publications starting with Nabeshima (1961) and Szwarc (1968). A survey of results on efficiently solvable special cases of the flow shop is provided by Monma and Rinnooy Kan (1983).…”

Section: Other Resultsmentioning

confidence: 99%

Fifty years of scheduling: a survey of milestones

Potts

Strusevich

2009

Journal of the Operational Research Society

172

View full text Add to dashboard Cite

Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models.

show abstract

Section: Other Resultsmentioning

confidence: 99%

Fifty years of scheduling: a survey of milestones

Potts

Strusevich

2009

Journal of the Operational Research Society

172

View full text Add to dashboard Cite

show abstract

“…Following the approach in [16], such a solution can be represented by a network N(x) which contains a vertex for each sublot on every machine (see Fig. 1).…”

Section: ) Machine Capacity Constraintsmentioning

confidence: 99%

Discrete Lot Streaming In Two-Machine Flow Shops

Chen

Steiner

1999

INFOR: Information Systems and Operational Research

View full text Add to dashboard Cite

“…Following the approach in [13], such a solu tion can be represented by a network N(x) which contains a vertex for each setup and each sublot on every machine (see Fig. 1).…”

Section: Corollarymentioning

confidence: 99%