An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem

The lot-streaming flow shop scheduling problem plays an important role in modern industry. This paper addresses this problem with the objective of minimizing the total weighted earliness and tardiness penalties and then proposes a simple but effective iterated local search (ILS) algorithm. In the proposed ILS algorithm, an adapted Nawaz–Enscore–Ham (NEH) heuristic is used to generate an initial solution. A local search procedure based on the insertion neighborhood is employed to perform local exploitation. A simulated-annealing-typed acceptance criterion is utilized to determine the start point for next iteration. Extensive experiments are conducted to compare the proposed ILS algorithm with some existing algorithms. The computational results and comparisons demonstrate the effectiveness of the proposed ILS algorithm.

[1]  Helena Ramalhinho Dias Lourenço,et al.  Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem , 1996 .

[2]  Gilbert Laporte,et al.  An iterated local search heuristic for the logistics network design problem with single assignment , 2008 .

[3]  N. Jawahar,et al.  Tabu Search and Simulated Annealing Algorithms for Scheduling in Flow Shops with Lot Streaming , 2007 .

[4]  Dirk Van Oudheusden,et al.  Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..

[5]  Subhash C. Sarin,et al.  A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots , 2001 .

[6]  R. G. Vickson,et al.  Two- and three-machine flow shop scheduling problems with equal sized transfer batches , 1992 .

[7]  Peter Brucker,et al.  Improving Local Search Heuristics for some Scheduling Problems. Part II , 1996, Discret. Appl. Math..

[8]  R. Vickson.  Optimal lot streaming for multiple products in a two-machine flow shop , 1995 .

[9]  Jose A. Ventura,et al.  An application of genetic algorithms to lot-streaming flow shop scheduling , 2002 .

[10]  N. Jawahar,et al.  Evolutionary algorithms for scheduling m-machine flow shop with lot streaming , 2008 .

[11]  Chih-Chiang Lin,et al.  A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks , 2010, EURASIP J. Wirel. Commun. Netw..

[12]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[13]  Quan-Ke Pan,et al.  An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .

[14]  C. Sriskandarajah,et al.  Lot streaming and scheduling multiple products in two-machine no-wait flowshops , 1999 .

[15]  S. Kreipl.  A large step random walk for minimizing total weighted tardiness in a job shop , 2000 .

[16]  Liang Gao,et al.  An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers , 2011, Inf. Sci..

[17]  Huan Neng Chiu,et al.  A comprehensive review of lot streaming , 2005 .

[18]  Ping Chen,et al.  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..

[19]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[20]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[21]  Jin-Kao Hao,et al.  Iterated local search for the multiple depot vehicle scheduling problem , 2009, Comput. Ind. Eng..

[22]  Quan-Ke Pan,et al.  An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem , 2011 .

[23]  Jing J. Liang,et al.  A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem , 2011, Expert Syst. Appl..

[24]  Ching-Jong Liao,et al.  A discrete particle swarm optimization for lot-streaming flowshop scheduling problem , 2008, Eur. J. Oper. Res..

[25]  N. Jawahar,et al.  Threshold accepting and Ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming , 2009 .

[26]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[27]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[28]  Jose A. Ventura,et al.  Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling , 2002, Comput. Oper. Res..

[29]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[30]  S. Reiter.  A System for Managing Job-Shop Production , 1966 .

[31]  William G. Truscott.  Production scheduling with capacity-constrained transportation activities , 1986 .

[32]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[33]  T. P. Bagchi,et al.  Lot streaming and scheduling heuristics for m -machine no-wait flowshops , 2000 .