Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
Year of publication: |
2024
|
---|---|
Authors: | Hoffmann, Julius ; Neufeld, Janis S. ; Buscher, Udo |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 27.2024, 6, p. 525-543
|
Subject: | Artificial Intelligence | Customer order scheduling | Dedicated machines | Earliness-tardiness | Iterated greedy algorithm | Machine scheduling | Metaheuristics | Scheduling-Verfahren | Scheduling problem | Künstliche Intelligenz | Artificial intelligence | Heuristik | Heuristics | Algorithmus | Algorithm | Theorie | Theory | Operations Research | Operations research |
-
Minimization of maximum lateness on parallel machines with a single server and job release dates
Elidrissi, Abdelhak, (2024)
-
Rault, Tifenn, (2024)
-
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
Lee, Kangbok, (2014)
- More ...
-
Hoffmann, Julius, (2024)
-
Scheduling dynamic job shop manufacturing cells with family setup times: A simulation study
Klausnitzer, Armin, (2017)
-
Maschinenbelegungsplanung mit Teilebewegungen zwischen Fertigungsinseln
Neufeld, Janis S., (2014)
- More ...