Scheduling the truckload operations in automatic warehouses

Abstract This work presents a scheduling problem that arises in an automatic storage/retrieval warehouse system AS/RS involving the scheduling of the truck load operations. The truck loading operations are modelled as job shop problem with recirculation. The loads are considered as jobs, the pallets of a load are seen as the job’s operations. The forklifts are the machines. The minimization of the makespan allows minimizing the idle time of the warehouse’s equipments. A procedure based on genetic algorithms is presented to sequence the pallets of a set of loads that are prepared simultaneously. The genetic algorithm includes specific knowledge of the problem to improve its efficiency. This work presents interesting computational results for the minimization of the makespan.

[1]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[2]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[3]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Erwin Pesch,et al.  The disjunctive graph machine representation of the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[6]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[7]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[8]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[9]  Isao Ono,et al.  A genetic algorithm for job-shop scheduling problems using job-based order crossover , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[10]  Moshe Eben-Chaime,et al.  Operations sequencing in automated warehousing systems , 1992 .

[11]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[12]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[13]  Yavuz A. Bozer,et al.  Travel-Time Models for Automated Storage/Retrieval Systems , 1984 .

[14]  Michael Kolonko,et al.  Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..

[15]  Sheik Meeran,et al.  New and “Stronger” Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996) , 2000, J. Heuristics.

[16]  Stephen C. Graves,et al.  Optimal Storage Assignment in Automatic Warehousing Systems , 1976 .

[17]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[18]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[19]  José A. Oliveira,et al.  Programação de operações em sistemas com tempo de processamento variável , 2002 .

[20]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[21]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[22]  Leon F. McGinnis,et al.  On Sequencing Retrievals In An Automated Storage/Retrieval System , 1987 .

[23]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[24]  Stephen C. Graves,et al.  Scheduling Policies for Automatic Warehousing Systems: Simulation Results , 1978 .