Exact and heuristic methods to solve the two-machine cross-docking flow shop scheduling problem
by Imen Hamdi; Yosr Hazgui
International Journal of Operational Research (IJOR), Vol. 42, No. 4, 2021

Abstract: In this paper we study the two-machine cross-docking flowshop scheduling problem. Cross-docking is an innovative logistical strategy in which a truck is unloaded from inbound (supplier) vehicles and directly loaded into outbound (customer) vehicules without storage in between or in less than 24 hours. We aim to determine the schedules of the inbound and outbound trucks in the crossdock while minimising the makespan. This problem is known to be NP-hard in the strong sense. We propose a mixed integer linear programming (MILP) which is tightened by adding valid inequalities. Also, we develop some heuristic methods which are based on some known and new priority rules. Then, we report the results of computational experiments on randomly generated problems.

Online publication date: Tue, 04-Jan-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com