Common operation scheduling with general processing times : a branch-and-cut algorithm to minimize the weighted number of tardy jobs
Claudio Arbib, Giovanni Felici, Mara Servilio
| Year of publication: |
2019
|
|---|---|
| Authors: | Arbib, Claudio ; Felici, Giovanni ; Servilio, Mara |
| Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 84.2018, p. 18-30
|
| Subject: | Scheduling | Pattern sequencing | Integer linear programming | Cover inequalities | Constrained submodular maximization | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.omega.2018.04.002 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011993124