Applying a hybrid job shop procedure to a Belgian manufacturing company producing industrial wheels and castors in rubber

Computers and Industrial Engineering

Volumn 61, Issue 3, 2011, Pages 697-708

  Sels, Veronique ^a   Steen, Frederic ^a   Vanhoucke, Mario ^a,b,c  

^a GHENT UNIVERSITY   (Belgium)

^b VLERICK BUSINESS SCHOOL   (Belgium)

^c UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Heuristic optimizations; Job shop scheduling; Manufacturing

Indexed keywords

BELGIAN MANUFACTURING; COMPLEX JOB SHOP; COMPUTATIONAL EXPERIMENT; HEURISTIC OPTIMIZATION; JOB SHOP; JOB-SHOP SCHEDULING; SCHEDULING PROBLEM; SHIFTING BOTTLENECK PROCEDURES; SIMULATION ENGINE; TABU SEARCH ALGORITHMS;

HEURISTIC METHODS; INDUSTRY; MANUFACTURE; RUBBER; TABU SEARCH; VEHICLES; WHEELS;

RUBBER APPLICATIONS;

EID: 80053204196     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.04.023     Document Type: Article

References (64)

1. J. Adams, E. Balas, and D. Zawack The shifting bottleneck procedure for job shop scheduling Management Science 34 1988 391 401
2. E. Anderson, and J. Nyirenda Two new rules to minimize tardiness in a job shop International Journal of Production Research 28 1990 2277 2292
3. D. Applegate, and W. Cook A computational study of the job-shop scheduling problem ORSA Jounal on Computing 3 1991 149 156
4. H. Aytug, K. Kempf, and R. Uzsoy Measures of subproblem criticality in decomposition algorithms for job shop scheduling International Journal of Production Research 41 2002 865 882
5. K. Baker Sequencing rules and due-date assignments in a job shop Management Science 30 1984 1093 1104 (Pubitemid 14651319)
6. E. Balas, J. Lenstra, and A. Vazacopoulos The one-machine problem with delayed precedence constraints and its use in job shop scheduling Management Science 41 1995 94 109
7. E. Balas, N. Simonetti, and A. Vazacopoulos Job shop scheduling with setup times, deadlines and precedence constraints Journal of Scheduling 11 2008 253 262
8. E. Balas, and A. Vazacopoulos Guided local search with shifting bottleneck for job shop scheduling Management Science 44 1998 262 274
9. J. Blazewicz, W. Domschke, and E. Pesch The job shop scheduling problem: Conventional and new solution techniques European Journal of Operational Research 93 1996 1 33 (Pubitemid 126389264)
10. P. Brucker, B. Jurisch, and B. Sievers A branch and bound algorithm for the job-shop scheduling problem Discrete Applied Mathematics 49 1994 107 127
11. J. Carlier The one-machine sequencing problem European Journal of Operational Research 11 1982 42 47
12. J. Carlier, and E. Pinson An algorithm for solving the job-shop problem Management Science 35 1989 164 176
13. R. Cheng, M. Gen, and Y. Tsujimura A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies Computers & Industrial Engineering 36 1999 343 364
14. J. Cheng, Y. Karuno, and H. Kise A shifting bottleneck approach for a parallel-machine flowshop scheduling problem Journal of the Operations Research Society of Japan 2001 44
15. K.-P. Chen, M. Lee, S. Pulat, and S. Moses The shifting bottleneck procedure for job-shops with parallel machines International Journal of Industrial and Systems Engineering 1 2006 244 262
16. S. Dauzre-Pérs, and J.-B. Lasserre A modified shifting bottleneck procedure for job-shop scheduling International Journal of Production Research 31 1993 923 932
17. F. Della Croce, R. Tadei, and G. Volta A genetic algorithm for the job shop problem Computers & Operations Research 22 1995 15 24
18. E. Demirkol, S. Mehta, and R. Uzsoy A computational study of shifting bottleneck procedures for shop scheduling problems Journal of Heuristics 3 1997 111 137 (Pubitemid 127505777)
19. U. Dorndorf, and E. Pesch Evolution based learning in a job shop scheduling environment Computers & Operations Research 22 1995 25 40
20. J. Gao, M. Gen, L. Sun, and X. Zhao A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems Computers & Industrial Engineering 53 2007 149 162 (Pubitemid 47042310)
21. M.R. Garey, D.S. Johnson, and R. Seth The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 1976 117 129
22. J. Gonalves, J. Mendes, and M. Resende A hybrid genetic algorithm for the job shop scheduling problem European Journal of Operational Research 167 2005 77 95 (Pubitemid 40220004)
23. R. Graham, E. Lawler, J. Lenstra, and A. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: A survey Annals of Discrete Mathematics 5 1979 287 326
24. O. Holthaus Design of efficient job shop scheduling rules Computers & Industrial Engineering 33 1997 249 252 (Pubitemid 127404362)
25. O. Holthaus, and C. Rajendran Efficient jobshop dispatching rules: Further developments Production Planning & Control 11 2000 171 178 (Pubitemid 35394368)
26. H. Holtsclaw, and R. Uzsoy Machine criticality measures and subproblem solution procedures in shifting bottleneck methods: A computational study Journal of the Operational Research 47 1996 666 667
27. W.-Q. Huang, and Z. Huang Algorithm based on taboo search and shifting bottleneck for job shop scheduling Journal of Computer Science and Technology 19 2004 776 781 (Pubitemid 40156617)
28. P. Ivens, and M. Lambrecht Extending the shifting bottleneck procedure to real-life applications European Journal of Operational Research 90 1996 252 268 (Pubitemid 126652213)
29. A. Jain, and S. Meeran Deterministic job-shop scheduling: Past, present and future European Journal of Operational Research 113 1999 390 434
30. M. Jayamohan, and C. Rajendran Development and analysis of cost-based dispatching rules for job shop scheduling European Journal of Operational Research 157 2004 307 321
31. C. Koulamas A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem Computers & Operations Research 25 1998 83 89
32. S. Mason, J. Fowler, and W. Carlyle A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops Journal of Scheduling 5 2002 247 262
33. S. Mason, J. Fowler, W. Carlyle, and D. Montgomery Heuristic for minimizing total weighted tardiness in complex job shops International Journal of Production Research 43 2005 1943 1963 (Pubitemid 41663554)
34. L. Mönch, and R. Drießel A distributed shifting bottleneck heuristic for complex job shops Computers & Industrial Engineering 49 2005 363 380 (Pubitemid 41436335)
35. L. Mönch, R. Schabacker, D. Pabst, and J. Fowler Generic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops European Journal of Operational Research 177 2007 2100 2118 (Pubitemid 44709466)
36. S. Mukherjee, and A. Chatterjee Applying machine based decomposition in 2-machine flow shops European Journal of Operational Research 169 2006 723 741 (Pubitemid 41492011)
37. S. Mukherjee, and A. Chatterjee On the representation of the one machine sequencing problem in the shifting bottleneck heuristic European Journal of Operational Research 182 2007 475 479 (Pubitemid 46578278)
38. B. Naderi, R. Ruiz, and M. Zandieh Algorithms for a realistic variant of flowshop scheduling Computers & Operations Research 37 2010 236 246
39. E. Nowicki, and C. Smutnicki An advanced tabu search algorithm for the job shop problem Journal of Scheduling 8 2005 145 159 (Pubitemid 40536998)
40. V. Osisek, and H. Aytug Discovering subproblem prioritization rules for shifting bottleneck algorithms Journal of Intelligent Manufacturing 15 2004 55 67
41. I. Ovacik, and R. Uzsoy A shifting bottleneck algorithm for scheduling semiconductor testing operations Journal of Electronics Manufacturing 2 1992 119 134
42. F. Pezzella, and E. Merelli A tabu search method guided by shifting bottleneck for the job shop scheduling problem European Journal of Operational Research 120 2000 297 310 (Pubitemid 30542651)
43. S. Ponnambalam, N. Jawahar, and P. Aravindan A simulated annealing algorithm for job shop scheduling Production Planning & Control 10 1999 767 777 (Pubitemid 30512782)
44. N. Raman Minimum tardiness scheduling in flow shops: Construction and evaluation of alternative solution procedures Journal of Operations Management 12 1995 131 151
45. A. Ramudhin, and P. Marier The generalized shifting bottleneck procedure European Journal of Operational Research 93 1996 34 48 (Pubitemid 126389265)
46. I. Ribas, R. Leisten, and J. Framinan Review and classification of hybrid flow shop scheduling problems from a production systems and a solutions procedure perspective Computers & Operations Research 27 2010 1439 1454
47. R. Ruiz, F. erifolu, and T. Urlings Modeling realistic hybrid flexible flowshop scheduling problems Computers & Operations Research 35 2008 1151 1175 (Pubitemid 47404765)
48. R. Ruiz, and J. Vázquez-Rodríguez The hybrid flow shop scheduling problem European Journal of Operational Research 205 2010 1 18
49. J. Schutten Practical job shop scheduling Annals of Operations Research 83 1998 161 177 (Pubitemid 128405245)
50. Sels, V.; Craeymeersch, K.; & Vanhoucke, M. (2010). A hybrid single and dual population search procedure for the job shop scheduling problem. Technical report, Ghent University.
51. Sels, V.; Gheysen, N.; & Vanhoucke, M. (2010). A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. Technical report, Ghent University.
52. D. Sha, and C.-Y. Hsu A hybrid particle swarm optimization for job shop scheduling problem Computers & Industrial Engineering 51 2006 791 808
53. M. Singer Decomposition methods for large job shops Computers & Operations Research 28 2001 193 207
54. X. Sun, and J. Noble An approach to job shop scheduling with sequence-dependent setups Journal of Manufacturing Systems 18 1999 416 430
55. E. Taillard Parallel taboo search techniques for the job shop scheduling problem ORSA Journal on Computing 6 1994 108 117
56. S. Topaloglu, and G. Kilincli A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization International Journal of Advanced Manufacturing Technology 44 2009 781 794
57. T. Urlings, R. Ruiz, and F. erifolu Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems International Journal of Metaheuristics 1 2010 30 54
58. T. Urlings, R. Ruiz, and T. Stützle Shifting representation search for hybrid flexible flowline problems European Journal of Operational Research 207 2010 1086 1095
59. R. Uzsoy, and C.-S. Wang Performance of decomposition procedures for job shop scheduling problems with bottleneck machines International Journal of Production Research 38 2000 1271 1286 (Pubitemid 35395516)
60. P. Van Laarhoven, E. Aarts, and J. Lenstra Job shop scheduling by simulated annealing Operations Research 40 1992 113 125
61. M. Watanabe, K. Ida, and M. Gen A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem Computers & Industrial Engineering 48 2005 743 752 (Pubitemid 40391494)
62. H. Wenqi, and Y. Aihua An improved shifting bottleneck procedure for the job shop scheduling problem Computers & Operations Research 31 2004 2093 2110 (Pubitemid 38728571)
63. C. Zhang, P. Li, Z. Guan, and Y. Rao A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem Computers & Operations Research 34 2007 3229 3242 (Pubitemid 46517853)
64. H. Zhou, Y. Feng, and L. Han The hybrid heuristic genetic algorithm for job shop scheduling Computers & Industrial Engineering 40 2001 191 200 (Pubitemid 32573623)