The Application of Lot Streaming to Assembly Job Shop under Resource Constraints

Assembly job shop problem (AJSP) is an extension of classical job shop problem (JSP). AJSP first starts with a JSP and appends an assembly stage after job completion. Lot Streaming (LS) technique is defined as the process of splitting lots into sub-lots such that successive operation can be overlapped. In this paper, the previous study of LS to AJSP will be extended by introducing resource constraints. To reduce the computational effort, we propose a new Genetic Algorithm (GA) approach which is the modification of the algorithm in our previous paper. A number of test problems are conducted to examine the performance of the new GA approach. Moreover, the single GA approach will be compared with a single Particle Swarm Optimization (PSO) approach. Computational results suggest that the new algorithm can outperform the previous one and the PSO approach with respect to the objective function.

[1]  Jinwoo Park,et al.  A batch splitting method for a job shop scheduling problem in an MRP environment , 1999 .

[2]  Fawaz S. Al-Anzi,et al.  A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times , 2007, Eur. J. Oper. Res..

[3]  Clarence H. Martin,et al.  A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming , 2009 .

[4]  Jiyin Liu,et al.  Single-job lot streaming in m , 2008, Eur. J. Oper. Res..

[5]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[6]  Dion H. Cummings Mckoy.  Production scheduling in a process and assembly job shop , 1999 .

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

[8]  D. H. Cummings,et al.  Minimizing production flow time in a process and assembly job shop , 1998 .

[9]  Alper Sen,et al.  Lot streaming in open shops , 1998, Oper. Res. Lett..

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

[11]  Felix T.S. Chan,et al.  Lot streaming for product assembly in job shop environment , 2008 .

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

[13]  Rajesh Srivastava,et al.  Priority scheduling policies for repair shops , 2000 .

[14]  George Steiner,et al.  On discrete lot streaming in no-wait flow shops , 2003 .

[15]  Kenneth R. Baker,et al.  Basic Techniques for Lot Streaming , 1993, Oper. Res..

[16]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

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

[18]  Wai Keung Wong,et al.  Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry , 2006, Comput. Ind. Eng..

[19]  Subhash C. Sarin,et al.  Optimal Solutions for the Single Batch, Flow Shop, Lot-streaming Problem with Equal Sublots , 2001, Decis. Sci..

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

[21]  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.

[22]  Stéphane Dauzère-Pérès,et al.  Lot Streaming in Job-Shop Scheduling , 1997, Oper. Res..

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

[24]  Charles E. Taylor.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Complex Adaptive Systems.John H. Holland , 1994 .

[25]  An interactive tool for designing manufacturing cells for an assembly job-shop , 2000 .

[26]  Fawaz S. Al-Anzi,et al.  A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application , 2006, Comput. Oper. Res..

[27]  Dean H. Kropp,et al.  Lot Splitting in Stochastic Flow Shop and Job Shop Environments , 1996 .

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