A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
Year of publication: |
2023
|
---|---|
Authors: | Abreu, Levi Ribeiro de ; Prata, Bruno A. ; Nagano, Marcelo ; Framinan, Jose M. |
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. 160.2023, p. 1-12
|
Subject: | Computational intelligence | Local search metaheuristics | Matheuristics | Production scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Prozessmanagement | Business process management | Künstliche Intelligenz | Artificial intelligence |
-
Minimization of maximum lateness on parallel machines with a single server and job release dates
Elidrissi, Abdelhak, (2024)
-
Rault, Tifenn, (2024)
-
Bicriteria two-machine flowshop scheduling : approximation algorithms and their limits
Jiang, Xiaojuan, (2024)
- More ...
-
New efficient heuristics for scheduling open shops with makespan minimization
Abreu, Levi Ribeiro de, (2022)
-
The seeds of the NEH algorithm : an overview using bibliometric analysis
Prata, Bruno de Athayde, (2023)
-
A two-stage fuzzy inference model to determine raw materials criticality in life sciences industries
Abreu, Levi Ribeiro de, (2023)
- More ...