Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations |
| |
Institution: | 1. LAAS-CNRS, Université de Toulouse, UPS, Toulouse, France;2. Università degli Studi di Siena, Dipartimento di Ingegneria dell''Informazione e Scienze Matematiche, via Roma 56, 53100 Siena, Italy;3. TBS Business School, 1 Place Alfonse Jourdain, 31000 Toulouse, France |
| |
Abstract: | We address a novel truck scheduling problem arising in crossdocking logistics, in which inbound trucks carry items (pallets) which must be sorted and loaded onto outbound trucks. We minimize the utilisation of the warehouse by focusing on the synchronisation between the different related trucks. The problem is to assign the trucks to the doors of the warehouse and sequence them, in order to minimize the total time spent in the system by the pallets. We discuss the complexity of the problem, showing that even with a single door the problem is NP-hard in general, and discuss some special cases. |
| |
Keywords: | Crossdocking Truck scheduling Complexity Flow time minimization |
本文献已被 ScienceDirect 等数据库收录! |
|