Logic-based benders decomposition for scheduling a batching machine

•A generalization of single batching machine scheduling with lateness objective.•A novel logic-based Benders decomposition algorithm.•The algorithm finds new best upper bounds in short time on literature instances.•The algorithm finds high-quality solutions on new instances from the AS/RS context. T...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 113; s. 104777
Hlavní autori:	Emde, Simon, Polten, Lukas, Gendreau, Michel
Médium:	Journal Article Paper
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.01.2020 Pergamon Press Inc Federal Reserve Bank of St. Louis
Predmet:	Algorithms Automated storage and retrieval Automated storage retrieval systems Benders decomposition Cranes Job shops Lateness Maximum lateness Operations research Precedence constraints Production scheduling Scheduling Single batching machine Upper bounds Precedence constraints Benders decomposition Single batching machine Automated storage and retrieval Maximum lateness
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!