Abstract: AbstractAbstractThe paper introduces the two-machine super-shop scheduling problem to minimize makespan. The well-known flow-shop, open-shop, job-shop and mixed-shop scheduling problems are special cases of our model. A polynomial-time algorithm to find both pre-emptive and non-pre-emptive optimal schedules is described.Keywords: shop schedulingpre-emptive and non-pre-emptive schedulingpolynomial-time algorithms
Publication Year: 1991
Publication Date: 1991-06-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 30
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot