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ženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 113; s. 104777
Hlavní autoři: Emde, Simon, Polten, Lukas, Gendreau, Michel
Médium: Journal Article Paper
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.01.2020
Pergamon Press Inc
Federal Reserve Bank of St. Louis
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•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. This paper investigates the problem of scheduling a set of jobs on a single batching machine to minimize the maximum lateness, where jobs may be subject to precedence constraints and incompatibilities. Single batching machine scheduling has many applications, but this study is particularly motivated by single crane scheduling in an automated storage and retrieval system (AS/RS): given a set of transport requests, which requests should be processed together in the same dual command cycle, and in what order should the cycles be processed? Since storage and retrieval requests may refer to the same physical item, precedence constraints must be observed. Moreover, the crane may not be capable of handling multiple storage or retrieval requests in the same cycle, hence the need to account for incompatibilities. We present a novel exact algorithm based on branch & Benders cut, which is shown to solve even large instances with more than 100 jobs to optimality in many cases. For the special case without precedence constraints and incompatibilities, it improves on several best-known upper bounds from the literature.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2019.104777