Dispatching in flowshops with bottleneck machines

Computers and Industrial Engineering

Volumn 52, Issue 1, 2007, Pages 89-106

  Rajendran, Chandrasekharan ^a   Alicke, Knut ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Bottleneck machines; Dispatching rules; Earliness; Flowshop; Flowtime; Tardiness

Indexed keywords

INDUSTRIAL ENGINEERING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

BOTTLENECK MACHINES; DISPATCHING RULES; FLOWSHOPS;

MACHINE SHOP PRACTICE;

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

References (48)

1. Ahmed I., and Fisher W.W. Due date assignment, job order release and sequencing interaction in job shop scheduling. Decision Sciences 23 (1992) 633-647
2. Baker K.R. The effects of input control in a simple scheduling model. Journal of Operations Management 4 (1984) 99-112
3. Baker K.R. Sequencing rules and due-date assignments in a job shop. Management Science 30 (1984) 1093-1104
4. Ben-Daya M., and Al-Fawzan M. A tabu search approach for the flow shop scheduling problem. European Journal of Operational Research 109 (1998) 88-95
5. Bergamaschi D., Cigolini R., Perona M., and Portioli A. Order review and release strategies in a job shop environment: a review and a classification. International Journal of Production Research 35 (1997) 399-420
6. Blackstone J.H., Phillips D.T., and Hogg G.L. A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research 20 (1982) 27-45
7. Campbell H.G., Dudek R.A., and Smith M.L. A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science 16 (1970) B630-B637
8. Cigolini R., Perona M., and Portioli A. Comparison of order review and release techniques in a dynamic and uncertain job shop environment. International Journal of Production Research 36 (1998) 2931-2951
9. Dannenbring D.G. An evaluation of flow-shop sequencing heuristics. Management Science 23 (1977) 1174-1182
10. Framinan J.M., Leisten R., and Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop. International Journal of Production Research 41 (2003) 121-148
11. Gelders L.F., and Sambandam N. Four simple heuristics for scheduling a flow-shop. International Journal of Production Research 16 (1978) 221-231
12. Goldratt E.M. What is this thing called theory of constraints and how should it be implemented? (1990), North River Press, Croton-on-Hudson, NY
13. Haupt R. A survey of priority rule-based scheduling. OR Spektrum 11 (1989) 3-16
14. Hasija S., and Rajendran C. Scheduling in flowshops to minimize total tardiness of jobs. International Journal of Production Research 42 (2004) 2289-2301
15. Hendry L., and Kingsman B. A decision support system for job release in make-to-order companies. International Journal of Operations and Production Management 11 (1991) 6-16
16. Hendry L., and Wong S.K. Alternative order release mechanisms: a comparison by simulation. International Journal of Production Research 32 (1994) 2827-2842
17. Ho J.C. Flowshop sequencing with mean flowtime objective. European Journal of Operational Research 81 (1995) 571-578
18. Ignall E., and Schrage L. Application of the branch-and-bound technique to some flowshop scheduling problems. Operations Research 13 (1965) 400-412
19. Ishibuchi H., Misaki S., and Tanaka H. Modified simulated annealing algorithms for the flow shop sequencing problems. European Journal of Operational Research 81 (1995) 388-398
20. Jayamohan M.S., and Rajendran C. New dispatching rules for shop scheduling: a step forward. International Journal of Production Research 38 (2000) 563-586
21. Johnson S.M. Optimal two- and three-stage production schedules. Naval Research Logistics 1 (1954) 61-68
22. Kanet J.J., and Hayya J.G. Priority dispatching with operation due-dates in a job shop. Journal of Operations Management 2 (1982) 167-176
23. Kim Y.D. Heuristics for flowshop scheduling problems with mean tardiness. Journal of Operational Research Society 44 (1993) 19-29
24. Lambrecht M., and Segaert A. Buffer stock allocation in serial and assembly type of production lines. International Journal of Production and Operations Management 10 (1990) 47-61
25. i scheduling problem. European Journal of Operational Research 132 (2001) 439-452
26. Luebbe R., and Finch B. Theory of Constraints and linear programming: a comparison. International Journal of Production Research 30 (1992) 1471-1478
27. Melnyk S.A., and Ragatz G.L. Order review/release: research issues and perspectives. International Journal of Production Research 27 (1989) 1081-1096
28. Miyazaki S., Nishiyama N., and Hashimoto F. An adjacent pairwise approach to the mean flow-timescheduling problem. Journal of the Operations Research Society of Japan 21 (1978) 287-299
29. Nawaz M., Enscore Jr. E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11 (1983) 91-95
30. max flowshop problem. Computers and Operations Research 17 (1990) 243-253
31. Philipoom P.R., and Fry T.D. Capacity based order review/release strategies to improve manufacturing performance. International Journal of Production Research 30 (1992) 2559-2572
32. Philipoom P.R., and Fry T.D. Order review/release in the absence of adherence to formal scheduling policies. Journal of Operations Management 17 (1999) 327-342
33. Parthasarathy S., and Rajendran C. Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell. Computers and Industrial Engineering 34 (1998) 531-546
34. Pinedo M. SCHEDULING Theory, Algorithms and Systems (1995), Prentice Hall, Englewood Cliffs
35. Plenert G. Optimising theory of constraints when multiple constrained resources exist. European Journal of Operational Research 70 (1993) 126-133
36. Ragatz G.L., and Mabert V.A. An evaluation of order release mechanisms in a job shop environment. Decision Sciences 19 (1988) 167-189
37. Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics 29 (1993) 65-73
38. Rajendran C., and Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research 103 (1997) 129-138
39. Rajendran C., and Holthaus O. A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research 116 (1999) 156-170
40. Rajendran C., and Ziegler H. Ant colony algorithms for permutation flowshop scheduling to minimize makespan/ total flowtime of jobs. European Journal of Operational Research 155 (2004) 426-438
41. Ramasesh R. Dynamic job shop scheduling: a survey of simulation research. OMEGA 18 (1990) 43-57
42. Russell G.R., and Fry T.D. Order review/release and lot splitting in drum-buffer-rope. International Journal of Production Research 35 (1997) 827-845
43. Spencer M.S. Theory of constraints in a service application: the Swine Graphics case. International Journal of Production Research 38 (2000) 1101-1108
44. Taillard E. Some efficient heuristic methods for the flowshop sequencing problem. European Journal of Operational Research 47 (1990) 65-79
45. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
46. Umble M.M., and Srikanth M.L. Synchronous Manufacturing (1990), South-Western, Cincinnati, Ohio
47. Widmer M., and Hertz A. A new heuristic method for the flowshop sequencing problem. European Journal of Operational Research 41 (1989) 186-193
48. Wight O.W. Input/output control - a real handle on lead time. Production and Inventory Management 11 (1970) 9-13