Volltext verfügbar nach Anmeldung bzw. im Campus-Netz.
A heuristic algorithm for two-stage flexible flow shop scheduling with head group constraint.
In: International Journal of Production Research, Jg. 51 (2013-02-01), Heft 3, S. 751-771
Online
academicJournal
Zugriff:
On the background of the shops in the mould manufacturers, in this paper, a two-stage flexible flow shop scheduling problem is first described to minimise the makespan with head group constraint and released time, where the first stage consists of unrelated parallel work centres. Next, this problem is proved to be NP-hard. After that, a constructive heuristic algorithm, named as H′, is proposed and then both its time complexity and worst-case bound are analysed in detail. In addition, three classical heuristics are improved for the solution of this problem and their time complexity is also given. In order to test the efficiency of the H′ algorithm, sets of instances are designed. Compared with the three improved heuristics by means of these sets of examples, the performance of the H′ algorithm is superior. Furthermore, the H′ algorithm can even solve large-size practical problems in a reasonable solution time, which is significant to the application in the shops of mould makers. [ABSTRACT FROM PUBLISHER]
Titel: |
A heuristic algorithm for two-stage flexible flow shop scheduling with head group constraint.
|
---|---|
Autor/in / Beteiligte Person: | Li, Zhan-tao ; Chen, Qing-xin ; Mao, Ning |
Link: | |
Zeitschrift: | International Journal of Production Research, Jg. 51 (2013-02-01), Heft 3, S. 751-771 |
Veröffentlichung: | 2013 |
Medientyp: | academicJournal |
ISSN: | 0020-7543 (print) |
DOI: | 10.1080/00207543.2012.662724 |
Schlagwort: |
|
Sonstiges: |
|