Minimizing makespan in two-stage hybrid cross docking scheduling problem

Authors:
Feng Chen;Kailei Song
Affiliations:
Department of Industrial Engineering and Management, Mechanical School, Shanghai Jiao Tong University, 800 Dong Chuan Road, Minhang District, Shanghai 200240, PR China;Department of Industrial Engineering and Management, Mechanical School, Shanghai Jiao Tong University, 800 Dong Chuan Road, Minhang District, Shanghai 200240, PR China
Venue:
Computers and Operations Research
Year:
2009

Citing 3
Cited 9

Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
Modeling realistic hybrid flexible flowshop scheduling problems

Computers and Operations Research
Minimizing makespan in hybrid flowshops

Operations Research Letters

Scheduling cross docking operations under full, partial and no information on inbound arrivals

Computers and Operations Research
A bounded dynamic programming approach to schedule operations in a cross docking platform

Computers and Industrial Engineering
Heuristic solutions for transshipment problems in a multiple door cross docking warehouse

Computers and Industrial Engineering
Multi-objective genetic-based algorithms for a cross-docking scheduling problem

Applied Soft Computing
A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock

Computers and Operations Research
Vehicle routing scheduling using an enhanced hybrid optimization approach

Journal of Intelligent Manufacturing
Three-stage hybrid-flowshop model for cross-docking

Computers and Operations Research
Truck scheduling in cross-docking terminals with fixed outbound departures

OR Spectrum
Exact algorithms for inventory constrained scheduling on a single machine

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies the two-stage hybrid cross docking scheduling problem. In which, the job in the second stage cannot be processed until its precedent subset jobs in the first stage have all been completed and at least one stage contains more than one machine. The objective is to minimize the makespan. Firstly, a mixed integer programming is presented and solved by CPLEX for small scale instances. Secondly, four heuristics are proposed to investigate the performance for moderate and large scale instances. Furthermore, one lower bound is given to compare with the four heuristics. Finally, computational experiments are carefully designed to illustrate and compare these approaches and computational results are reported in detail.