In this paper, a scheduling problem which allows a warehouse to function as a crossdock where transit storage time for cargo is minimized according to Just in Time scheduling is studied. A model that uses the machine scheduling notation to describe the problem is written. As the problem is NP-hard, a solution approach based on a combination of two metaheuristics, Reactive GRASP and Tabu Search (RGTS), is provided. Experiments are carried out to determine the usefulness of this approach. The results obtained from the exact method that uses the ILOG CPLEX 9.1 solver for 16 problem instances and the results obtained from the RGTS metaheuristic scheduling algorithm and two other algorithms proposed by other authors for the same problem instances are discussed. Analysis and comparisons are made.Journal of the Operational Research Society (2009) 60, 554-564. doi:10.1057/palgrave.jors.2602590 Published online 19 March 2008.
ASJC Scopus subject areas
- Statistics, Probability and Uncertainty
- Modeling and Simulation
- Strategy and Management
- Management Science and Operations Research