A heuristic and an exact method for the gate matric connection cost minimization problem
Year of publication: |
2013
|
---|---|
Authors: | De Giovanni, Luigi ; Massi, G. ; Pezzella, F. ; Pfetsch, M. E. ; Rinaldi, Giovanni |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 20.2013, 5, p. 627-643
|
Subject: | time of open stacks | macimum number of open stacks | pattern sequencing | genetic algorithms | dynamic fitness function | integer linear programming | branch-and-cut | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Evolutionärer Algorithmus | Evolutionary algorithm | Scheduling-Verfahren | Scheduling problem |
-
An adaptive penalty guided genetic algorithm for scheduling parallel batch processing machines
Xu, Shubin, (2018)
-
Modelling and solving approaches for scheduling problems in reconfigurable manufacturing systems
Delorme, Xavier, (2024)
-
Crane scheduling problem with non-interference constraints in a steel coil distribution centre
Maschietto, Gabriela N., (2017)
- More ...
-
An adaptive genetic algorithm for large-size open stack problem
De Giovanni, Luigi, (2013)
-
Optimal shift coloring of trees
Adreatta, Giovanni, (2014)
-
Optimal shift partitioning of pharmacies
Andreatta, Giovanni, (2015)
- More ...