Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag time

International Journal of Production Research

Volumn 50, Issue 8, 2012, Pages 2331-2352

  Defersha, Fantahun M ^a   Chen, Mingyuan ^b  

^a UNIVERSITY OF GUELPH   (Canada)

^b Dept of Electrical and Computer Engineering   (Canada)

Author keywords

flexible jobshop scheduling; lag time; lot streaming; machine release date; parallel genetic algorithm; sequence dependent setup

Indexed keywords

FLEXIBLE JOB-SHOP SCHEDULING; LAG-TIME; LOT STREAMING; PARALLEL GENETIC ALGORITHMS; RELEASE DATE; SEQUENCE DEPENDENT SETUPS;

MANUFACTURE; SCHEDULING ALGORITHMS;

STREAM FLOW;

EID: 84861416467     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.574952     Document Type: Article

References (56)

1. Alba, E. and Troya, J.M., 2000. Influence of the migration policy in parallel distributed gas with structured and panmictic populations. Applied Intelligence, 12 (3), 163-181.
2. Baker, K.R., 1990. Solution procedures for the lot streaming problem. Decision Sciences, 21 (3), 475-491.
3. Baker, K., 1974. Introduction to sequence and scheduling. New York: Wiley.
4. Baker, K., 1995. Lot streaming in the two-machine flow shop with setup times. Annals of Operations Research, 57 (1), 1-11.
5. Biskup, D. and Feldmann, M., 2006. Lot streaming with variable sublots: an integer programming formulation. Journal of the Operational Research Society, 57 (3), 296-303.
6. Blackburn, J., 1991. Time-based competition. Burr Ridge, IL: Business One Irwin.
7. Bockerstette, J. and Shell, R., 1993. Time based manufacturing. New York: McGraw-Hill.
8. Bukchin, J. and Masin, M., 2004. Multi-objective lot splitting for a single product m-machine flowshop line. IIE Transactions, 36 (2), 191-202.
9. Buscher, U. and Shen, L., 2009. An integrated tabu search algorithm for the lot streaming problem in job shops. European Journal of Operational Research, 199 (2), 385-399.
10. Cantú -Paz, E., 2000. Efficient and accurate parallel genetic algorithms. Norwell, MA: Kluwer Academic.
11. Chan, F., Wong, T., and Chan, P., 2004. Equal size lot streaming to job-shop scheduling problem using genetic algorithm. In: Proceedings of the 2004 IEEE international symposium on intelligent control, 2-4 September 2004, Taipei, Taiwan, 472-476.
12. Chan, F., Wong, T., and Chan, P., 2005. Lot streaming technique in job-shop environment. In: Proceedings of the 13th Mediterranean conference on control and automation, 27-29 June 2005, Limassol, Cyprus, 364-369.
13. Chan, F., Wong, T., and Chan, P., 2008. Lot streaming for product assembly in job shop environment. Robotics and Computer- Integrated Manufacturing, 24 (3), 321-331.
14. Chan, F., Wong, T., and Chan, P., 2009. The application of genetic algorithms to lot streaming in a job-shop scheduling problem. International Journal of Production Research, 47 (12), 3387-3412.
15. Chang, J.H. and Chiu, H.N., 2005. A comprehensive review of lot streaming. International Journal of Production Research, 43 (8), 1515-1536.
16. Chen, H., Ihlow, J., and Lehmann, C., 1999. A genetic algorithm for flexible job-shop scheduling. In: Proceedings of the 1999 IEEE international conference on robotics & automation, May 1999, Detroit, Michigan, 1120-1125.
17. Chen, J. and Steiner, G., 1996. Lot streaming with detached setups in three-machine flow shops. European Journal of Operational Research, 96 (3), 591-611.
18. Chen, J., et al., 2008. A study of the flexible job shop scheduling problem with parallel machines and reentrant process. International Journal of Advanced Manufacturing Technology, 39 (3-4), 344-354.
19. Chiu, H.N., Chang, J.H., and Lee, C.H., 2004. Lot streaming models with a limited number of capacitated transporters in multistage batch production systems. Computers & Operations Research, 31 (12), 2003-2020.
20. Conway, R. and Maxwell, W., 1967. Theory of scheduling. Reading, MA: Addison-Wesley.
21. Dauzere-Peres, S. and Lasserre, J., 1993. An iterative procedure for lot streaming in job-shop scheduling. Computers and Industrial Engineering, 25 (1-4), 231-234.
22. Dauzere-Peres, S. and Lasserre, J., 1997. Lot streaming in job-shop scheduling. Operations Research, 45 (4), 584-595.
23. Edis, R. and Ornek, A., 2009. Simulation analysis of lot streaming in job shops with transportation queue disciplines. Simulation Modelling Practice and Theory, 17 (2), 442-453.
24. Feldmann, M. and Biskup, D., 2008. Lot streaming in a multiple product permutation flow shop with intermingling. International Journal of Production Research, 46 (1), 197-216.
25. Gao, J., et al., 2007. A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Computers & Industrial Engineering, 53 (1), 149-162.
26. Gao, J., Sun, L., and Gen, M., 2008. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research, 35 (9), 2892-2907.
27. Garey, M.R., Johnson, D.S., and Sethi, R., 1976. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1 (2), 117-129.
28. Glass, C., Gupta, J.N.D., and Potts, C., 1994. Lot streaming in three-stage process. European Journal of Operations Research, 75 (2), 378-394.
29. Gordon, V., and Whitley, D., 1993. Serial and parallel genetic algorithms as function optimizers. In: S. Forrest, ed. Proceedings of the fifth international conference on genetic algorithms, San Mateo, CA: Morgan Kaufmann, 177-183.
30. Gupta, J., 1986. Flowshop schedules with sequence dependent setup times. Journal of Operations Research Society of Japan, 29 (3), 206-219.
31. Hall, N.G., et al., 2003. Scheduling and lot streaming in flow shops with no-wait in process. Journal of Scheduling, 6 (4), 339-354.
32. Jacobs, F. and Bragg, D., 1988. Repetitive lots: flow time reductions through sequencing and dynamic batch sizing. Decision Science, 19 (2), 281-294.
33. Jeong, H., Park, J., and Leachman, R., 1999. A batch splitting method for a job shop scheduling problem in an MRP environment. International Journal of Production Research, 37 (15), 3583-3598.
34. Kacem, I., 2003. Genetic algorithm for the flexible jobshop scheduling problem. In: Proceedings of the IEEE international conference on systems, man, and cybernetics, Washington, DC, 3464-6469.
35. Kochhar, S. and Morris, R., 1987. Heuristic methods for flexible flow line scheduling. Journal of Manufacturing Systems, 6 (4), 299-314.
36. Kumar, S., Bagchi, T., and Sriskandarajah, C., 2000. Lot streaming and scheduling heuristics for m-machine no-wait flow shop. Computers and Industrial Engineering, 38 (1), 149-172.
37. Liu, S.C., 2003. A heuristic method for discrete lot streaming with variable sublots in a flow shop. International Journal of Advanced Manufacturing Technology, 22 (9-10), 662-668.
38. Low, C., Hsu, C., and Huang, K., 2004. Benefits of lot splitting in job-shop scheduling. International Journal of Advanced Manufacturing Technology, 24 (9-10), 773-780.
39. Manikas, A. and Chang, Y., 2009. Multi-criteria sequence-dependent job shop scheduling using genetic algorithms. Computers & Industrial Engineering, 56 (1), 179-185.
40. Marimuthu, S., Ponnambalam, S.G., and Jawahar, A.N., 2008. Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robotics and Computer-Integrated Manufacturing, 24 (1), 125-139.
41. Martin, C.H., 2009. A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming. OMEGA International Journal of Management Sciences, 37 (1), 126-137.
42. Nowostawski, M. and Poli, R., 1999. Parallel genetic algorithm taxonomy. In: Proceedings of the third international conference on knowledge-based intelligent information engineering system, Adelaide, Australia, 88-92.
43. Osman, I. and Potts, C., 1989. Simulated annealing for permutation flow-shop scheduling. Omega, 17 (6), 551-557.
44. Panwalkar, S.S., Dudek, R.A., and Smith, M.L., 1973. Sequencing research and the industrial scheduling problem. In: S.E. Elmaghraby, ed. Symposium on the theory of scheduling and its applications. Berlin: Springer, 29.
45. Pezzella, F., Morganti, G., and Ciaschetti, G., 2008. A genetic algorithm for the Flexible Job-shop Scheduling Problem. Computers and Operations Research, 35 (10), 3202-3212.
46. Potts, C. and Baker, K., 1989. Flow shop scheduling with lot streaming. Operations Research Letter, 8 (6), 297-303.
47. Reeves, C.R., 1995. A genetic algorithm for flowshop sequencing. Computers and Operations Research, 22 (1), 5-13.
48. Reiter, S., 1966. A system for managing job shop production. Journal of Business, 39 (3), 371-393.
49. Rios-Mercado, R. and Bard, J., 1999. A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times. IIE Transactions, 31 (8), 721-731.
50. Ruiz, R., Maroto, C., and Alcaraz, J., 2005. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165 (1), 34-54.
51. Ruiz, R., Serifoglub, F.S., and Urlings, T., 2008. Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research, 35 (4), 1151-1175.
52. Saidi, M. and Fattahi, P., 2007. Flexible job shop scheduling with tabu search algorithm. International Journal of Advanced Manufacturing Technology, 35 (5-6), 563-570.
53. Smunt, T., Buss, A., and Kropp, D., 1996. Lot splitting in stochastic flow shop and job shop environments. Decision Science, 27 (2), 215-238.
54. Tseng, C.T. and Liao, C.J., 2008. A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. European Journal of Operational Research, 199 (2), 360-373.
55. Vickson, R., 1995. Optimal lot streaming for multiple products in a two-machine flow shop. European Journal of Operations Research, 85 (3), 556-575.
56. Xing, L., Chen, Y., and Yang, K., 2009. Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling. Applied Soft Computing, 9 (1), 362-376.