Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
Year of publication: |
2020
|
---|---|
Authors: | Gerstl, Enrique ; Mosheiov, Gur |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 23.2020, 3, p. 289-299
|
Subject: | Scheduling | Single machine | Generalized due dates | NP-hardness | Heuristic | Branch-and-bound algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Branch-and-Bound | Branch and Bound | Produktionssteuerung | Production control |
-
Wang, Xiuli, (2015)
-
Massabo, Ivar, (2016)
-
Ozturk, Onur, (2017)
- More ...
-
A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines
Gerstl, Enrique, (2013)
-
A two-stage flexible flow shop problem with unit-execution-time jobs and batching
Gerstl, Enrique, (2014)
-
Due-window assignment with identical jobs on parallel uniform machines
Gerstl, Enrique, (2013)
- More ...