Johnson's algorithm: A key to solve optimally or approximately flow shop scheduling problems with unavailability periods

Hamid Allaoui and AbdelHakim Artiba

International Journal of Production Economics, 2009, vol. 121, issue 1, 81-87

Abstract: Johnson's algorithm (JA) is perhaps the most classical algorithm in the scheduling area. JA gives the optimal solution to the two machine flow shop to minimize the makespan in polynomial time. Researchers have tried to extend this notorious result to obtain polynomial time algorithms for more general cases. Such importance motivated us to devote this paper to JA applied to three flow shop problems with unavailability periods to minimize the makespan. First we focus on the optimality condition of JA. Then we propose a modification of JA. After we calculate new performances of JA as a heuristic. Last we deal with an extension of JA.

Keywords: Johnson's; algorithm; Flow; shop; Scheduling; Unavailability; Approximation (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00107-8
Full text for ScienceDirect subscribers only

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:eee:proeco:v:121:y:2009:i:1:p:81-87

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().