Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
Year of publication: |
May 2017
|
---|---|
Authors: | Rosa, Bruno Ferreira ; Souza, Marcone Jamilson Freitas ; Souza, Sérgio Ricardo de ; França Filho, Moacir Felizardo de ; Ales, Zacharie ; Michelon, Philippe |
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. 81.2017, p. 203-215
|
Subject: | Scheduling | Makespan | Idle time | Enumeration algorithm | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Theorie | Theory |
-
On the exact solution of the no-wait flow shop problem with due date constraints
Samarghandi, Hamed, (2017)
-
Stability of a schedule minimising the makespan for processing jobs on identical machines
Sotskov, Jurij Nazarovič, (2023)
-
Batch scheduling in differentiation flow shops for makespan minimisation
Huang, Ting-chih, (2013)
- More ...
-
Multi-Objective Mammography Unit Location-Allocation Problem : A Case Study
Campos, Marcos Vinícius Andrade de, (2023)
-
Formulations and heuristic for the long-term preventive maintenance order scheduling problem
Andrade, João Luiz Marques de, (2024)
-
Bezerra, Sinaide Nunes, (2023)
- More ...