Split-merge : using exponential neighborhood search for scheduling a batching machine
| Year of publication: |
2015
|
|---|---|
| Authors: | Cabo, Marta ; Possani, Edgar ; Potts, Chris N. ; Song, Xiang |
| 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. 63.2015, p. 125-135
|
| Subject: | Batching machine | Maximum lateness | Local search | Exponential neighborhoods | Dynamic programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Dynamische Optimierung | Nachbarschaft | Neighbourhood | Produktionssteuerung | Production control | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A note on "algorithms for the Calzedonia workload allocation problem"
Pereira, Jordi, (2022)
-
Pruning rules for optimal runway sequencing
De Maere, Geert, (2018)
-
Approximate dynamic programming for an energy-efficient parallel machine scheduling problem
Heydar, Mojtaba, (2022)
- More ...
-
An adaptive branching rule for the permutation flow-shop problem
Potts, Chris N., (1980)
-
Potts, Chris N., (1985)
-
A parametric method to enhance decision-making in airport terminal development
Beasley, John, (2025)
- More ...