Abstract
Cross-docking is a strategy to reduce cargos’ total flow time as well as total cost. This paper considers a truck scheduling problem in a cross-docking system where the unloading process can be interrupted and the number of preemption is limited. An integer programming model is developed for this problem and the objective is to minimize the makespan by determining the sequences of inbound and outbound trucks. Then, a particle swarm optimization algorithm is proposed to solve this model. Finally, computational experiments considering preemption and non-preemption are done. The results prove the proposed approach performs better than existing model does when the waiting time of cargos for unloading is very long.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
