A new heuristic for open shop total completion time problem

The m-machine open shop problem to minimize the sum of the completion times is investigated in our paper. First, a heuristic algorithm, Shortest Processing Time Block, is presented to deal with problem O m | n = km | ∑ C j , where k is positive integer. And then, the heuristic is extended to solve t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applied mathematical modelling 2010-03, Vol.34 (3), p.735-743
Hauptverfasser:	Tang, Lixin, Bai, Danyu
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Asymptotical analysis Blocking Completion time Exact sciences and technology Heuristic Heuristic methods Inventory control, production control. Distribution Mathematical models Modelling Open shop problem Operational research and scientific management Operational research. Management science Total completion time
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The m-machine open shop problem to minimize the sum of the completion times is investigated in our paper. First, a heuristic algorithm, Shortest Processing Time Block, is presented to deal with problem O m \| n = km \| ∑ C j , where k is positive integer. And then, the heuristic is extended to solve the general problem O m ‖ ∑ C j . It is proved that the heuristic is asymptotically optimal when the job number goes to infinity. At the end of this paper, numerical experimentation results show the effectiveness of the heuristic algorithm.
ISSN:	0307-904X
DOI:	10.1016/j.apm.2009.06.014