Single machine rescheduling for new orders with maximum lateness minimization
Year of publication: |
2022
|
---|---|
Authors: | Rener, Elena ; Salassa, Fabio ; T'kindt, Vincent |
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. 144.2022, p. 1-8
|
Subject: | Branch & memorize | Maximum lateness | Single machine rescheduling | Total disruption | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time |
-
Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
Gawiejnowicz, Stanisław, (2014)
-
Two-stage flow shop scheduling with dedicated machines
Lin, Bertrand M. T., (2015)
-
A note on reverse scheduling with maximum lateness objective
Li, S. S., (2013)
- More ...
-
A hybrid heuristic approach for single machine scheduling with release times
Della Croce, Federico, (2014)
-
Exact solution of the two-machine flow shop problem with three operations
Della Croce, Federico, (2022)
-
Parallel batching with multi-size jobs and incompatible job families
Druetto, Alessandro, (2023)
- More ...