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...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 113; p. 104777
Main Authors:	Emde, Simon, Polten, Lukas, Gendreau, Michel
Format:	Journal Article Paper
Language:	English
Published:	New York Elsevier Ltd 01.01.2020 Pergamon Press Inc Federal Reserve Bank of St. Louis
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!