Increasing the Revenue of Self-Storage Warehouses by Optimizing Order Scheduling
Autor: | Xiandong Zhang, René de Koster, Yeming Gong, Steef van de Velde, Shuyu Zhou |
---|---|
Přispěvatelé: | emlyon business school, Department of Management of Technology and Innovation, Department of Technology and Operations Management, Rotterdam School of Management |
Jazyk: | angličtina |
Rok vydání: | 2016 |
Předmět: |
Mathematical optimization
Information Systems and Management General Computer Science Computer science Real-time computing 0211 other engineering and technologies Scheduling (production processes) Order scheduling Time horizon Multiprocessing 02 engineering and technology Multiprocessor task scheduling Management Science and Operations Research Industrial and Manufacturing Engineering Scheduling (computing) 0202 electrical engineering electronic engineering information engineering Revenue Branch-and-price Column generation Self-storage warehouse 021103 operations research Scheduling Branch and price [SHS.ECO]Humanities and Social Sciences/Economics and Finance Warehouse Modeling and Simulation [SHS.GESTION]Humanities and Social Sciences/Business administration 020201 artificial intelligence & image processing |
Zdroj: | European Journal of Operational Research European Journal of Operational Research, 2016, pp.69-78 P European Journal of Operational Research, 252(1), 69-78. Elsevier European Journal of Operational Research, Elsevier, 2016, pp.69-78 P |
ISSN: | 0377-2217 |
Popis: | International audience; We consider a self-storage warehouse, facing storage orders for homogeneous or heterogeneous storage units over a certain time horizon. The warehouse operations manager needs to decide which storage orders to accept and schedule them across different storage units to maximize revenue. We model warehouse operations as scheduling n independent multiprocessor tasks with given start and end times, with an objective to maximize revenue. With operational constraints like the maximal upscaling level, precedence order constraints, and maximal idle time, the established mixed-integer program cannot be efficiently solved by commercial softwares. We therefore propose a column generation approach and a branch-and-price method to find an optimal schedule. Computational experiments show that, compared with current methods in self-storage warehouses, our method can significantly increase the revenue. |
Databáze: | OpenAIRE |
Externí odkaz: |