A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
Ghasem Moslehi; Danial Khorasanian
| Year of publication: |
2014
|
|---|---|
| Authors: | Moslehi, Ghasem ; Khorasanian, Danial |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 52.2014, B, p. 260-268
|
| Subject: | Scheduling | Limited-buffer permutation flow shop | Makespan | Variable neighborhood search | Simulated annealing algorithm | Blocking flow shop | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Algorithmus | Algorithm | Theorie | Theory |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011281729