Simulated annealing for permutation flow-shop scheduling

Ih Osman and Cn Potts

Omega, 1989, vol. 17, issue 6, 551-557

Abstract: The problem of scheduling jobs in a flow-shop is considered. The job processing order must be the same on each machine and the objective is to minimize the maximum completion time. Simulated annealing is proposed as a heuristic to obtain approximate solutions. Extensive computational tests with problems having up to 20 machines and 100 jobs show simulated annealing to compare favourably with known constructive heuristics and with descent methods.

Keywords: scheduling; flow-shop; heuristics; simulated; annealing (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (66)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(89)90059-5
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:17:y:1989:i:6:p:551-557

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 (repec@elsevier.com).