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 Seido ; 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 | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Prozessmanagement | Business process management |
-
Akhoondi, Fateme, (2016)
-
Hosseinzadeh, Mohammad Reza, (2022)
-
A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system
Xu, Rui, (2013)
- 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)
-
Abreu, Levi R., (2023)
- More ...