Scheduling heuristic for the n-jobm-machine flow shop

S Sarin and M Lefoka

Omega, 1993, vol. 21, issue 2, 229-234

Abstract: This paper addresses the problem of scheduling jobs in a flow shop manufacturing environment. A heuristic approach is developed for determining a priority sequence for the jobs with a view to minimizing total time to complete all the jobs. The approach is based on minimizing idle time on the last machine. The procedure is tested computationally and compared with the best known heuristic for flow shop sequencing. The proposed procedure demonstrates superior performance on larger problems, both in terms of quality of the solution and execution speed.

Keywords: flow; shop; sequencing; production; scheduling; heuristics (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(93)90055-P
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:jomega:v:21:y:1993:i:2:p:229-234

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().