Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
Jeffrey Schaller, Jorge Valente
| Year of publication: |
2019
|
|---|---|
| Authors: | Schaller, Jeffrey ; Valente, Jorge |
| 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. 109.2019, p. 1-11
|
| Subject: | Scheduling | Branch-and-Bound | Flow shop | Earliness and tardiness | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Branch and Bound | Theorie | Theory | Produktionsplanung | Production planning | Fließfertigung | Assembly-line production | Produktionssteuerung | Production control | Heuristik | Heuristics |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2019.04.017 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012065011