A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
Gulcin Bektur, Tugba Saraç
| Year of publication: |
2019
|
|---|---|
| Authors: | Bektur, Gulcin ; Saraç, Tugba |
| 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. 103.2019, p. 46-63
|
| Subject: | Unrelated parallel machine scheduling | Scheduling with a common server | Simulated annealing | Tabu search | Sequence-dependent setup times | Dispatching rule | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Theorie | Theory | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2018.10.010 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011991088