Production planning and industrial scheduling: Examples, case studies and applications, second edition

Production Planning and Industrial Scheduling: Examples, Case Studies and Applications, Second Edition

Volumn , Issue , 2007, Pages 1-535

  Sule, Dileep R ^a  

^a LOUISIANA TECH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85056496423     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (196)

1. Cavinato, Joseph L. 2002. “What’s Your Supply Chain Type?” Supply Chain Management Review (May–June): 60–66.
2. Chopra, Sunil. 2003. “Designing Delivery Network for a Supply Chain” Transportation Research, Part E (39): 123–140.
3. Fisher Marshall, L. 1997. “What Is the Right Supply Chain for Your Product?” Harvard Business Review (March–April): 83–93.
4. Goodwin, B., M. Seegart, J. Cardillo, and E. Bergmann. 1996. “Implementing ERP in a Big Way” APICS-The Performance Advantage, June
5. Holstein, W.K. 1968. “Production Planning and Control Integrated” Harvard Business Review, May/June: 70–82.
6. Magretta, Joan. 1998. “Fast, Global and Entrepreneurial: Supply Chain Management, Hong Kong Style” Harvard Business Review (September–October): 102–114.
7. Van Dierdonck, R. and J.G. Miller. 1980. “Designing Production Planning and Control Systems” Journal of Operations Management, 1(1): 102–112.
8. Amram, Martha and Nalin Kulatilaka. 1999. Real Options, Cambridge, MA: Harvard Business School Press.
9. Ballou, Ronald H. 1999. Business Logistics Management, Upper Saddle River, NJ: Prentice Hall.
10. Daskin, Mark S. 1995. Network and Discrete Location, New York: John Wiley & Sons.
11. Harding, Charles F. 1988. “Quantifying Abstract Factors in Facility Location Decisions” Industrial Development (May–June): 24–28.
12. Korpela, Jukka, Antti Lehmusvaara, and Marku Tuominen. 2001. “Customer Service Based Design of the Supply Chain” International Journal of Production Economics 69: 193–204.
13. Luehrman, Timothy A. 1995. “Capital Projects as Real Options: An Introduction” Harvard Business School, case 9-295-074.
14. McCormack, Alan D., Lawerence J. Newman III, and Donald B. Rosenfield. 1994. “The New Dynamics of Global Manufacturing Site Location” Sloan Management Review (Summer): 69–79.
15. Note on Facility Location. 1989. Harvard Business School, note 9-689-059.
16. Armstrong, J.S. 1986. “The Ombudsman: Research on Forecasting: AQuarter Century Review, 1960–1984” Interfaces, January–February.
17. Box, G.E.P. and G.M. Jenkins. 1970. Time Series Analysis: Forecasting and Control, New-York: Holden-Day.
18. Chambers, J.C., S.K. Mullick, and D.D. Smith. 1971. “How to Choose the Right Forecasting Technique” Harvard Business School, July–August: 45–74.
19. Dougherty, John R. “Getting Started with Production Planning” Readings in Production and Inventory Control and Planning, APICS 27th Annual Conference, 1984, pp. 176–79.
20. Gupta, S. and P.C. Wilton. March 1987. “Combinations of Forecasts: An Extension” Management Science, 33(3).
21. Hodgeson, T.J., R.E. King, and C.U. King. 1990. “Development of Production Planning System: A Case History” Production and Inventory Management 31(4): 18–24.
22. Holt, C.C., F. Modigliani, J.F. Muth, and H.A. Simon. 1960. Planning Production, Inventories and Workforce, New York: Prentice Hall.
23. Konijnendijk, P.A. 1982. Coordination of Production and Sales, Eindhoven, the Netherlands: Technical Eindhoven University.
24. Lawrence, M.J., R.H. Edmundson, and M.J. O’Connor. December 1986. “Accuracy of Combining Judgmental and Statistical Forecasts” Management Science, 32(12).
25. Ling, R.C. and W.E. Goddard. 1995. Orchestrating Success: Improved Control of Business with Sales and Operations Planning, New York: John Wiley & Sons.
26. Winters, P.R. April 1960. “Forecasting Sales by Exponentially Weighted Moving Averages” Management Science, 6: 324–342.
27. Berry, W.L., T.E. Vollmann, and D.C. Whybark. 1979. Master Production Scheduling: Principles and Practice, Falls Church, VA: American Production and Inventory Control Society.
28. Davis, E.W. 1979. Case Studies in Materials Requirement Planning, Falls Church, VA: American Production and Inventory Control Society.
29. Dougherty, J.R. and J.F. Proud. “From Master Schedules to Finishing Schedules in the 1990s” American Production and Inventory Control Society, 1990 Annual Conference Proceedings, 1990, pp. 368–370.
30. Ford, Q. “Distribution Requirement Planning and MRP” APICS 24th Annual Conference Proceedings, 1981, pp. 275–278.
31. Funk, P.N. “The Master Schedulers Job Revisited” American Production and Inventory Control Society, 1990 Annual Conference Proceedings, pp. 374–377.
32. Harvard Business Review, September–October, 1975.
33. Kinsey John, W. “Master Production Planning: The Key to Successful Master Scheduling” APICS 24th Annual Conference Proceedings, 1981, pp. 81–85.
34. Orlicky, J. 1975. Materials Requirement Planning, New York: McGraw-Hill.
35. Proud John, F. “Controlling the Master Schedule” APICS 23rd Annual Conference Proceedings, 1980, pp. 413–416.
36. Smith, B. July 1985. “DRP improves Productivity, Profit and Service Levels” Modern Materials Handling, 63–65.
37. Baker, K.R., M.J. Magazine, and H.L.W. Nuttle. August 1986. “The Effect of Commonality on Safety Stock in a Simple Inventory Model” Management Science, 32(8).
38. Berry, W.L., T. Schmitt, and T.E. Vollmann. November 1982. “Capacity Planning Techniques for Manufacturing Control Systems: Information Requirements and Operational Features” Journal of Operations Management, 3(1).
39. Blackstone, J.H. Jr. 1989. Capacity Management, Cincinnati, OH: South-Western Publishing.
40. Brown, R.G. 1967. Decision Rules for Inventory Management, New York: Holt, Rinehart & Winston.
41. Burlingame, L.J. “Extended Capacity Planning” APICS Annual Conference Proceedings, 1974, pp. 83–91.
42. Constable, G.C. and D.C. Whybark. October 1978. “The Interaction of Transportation and Inventory Decisions” Decision Sciences, 9(4): 688–699.
43. Crowther J. 1964. “Rationale for Quantity Discounts” Harvard Business Review, (March–April): 121–127.
44. Dolan Robert, J. 1987. “Quantity Discounts: Managerial Issues and Research Opportunities” Marketing Science, 6: 1–24.
45. Lankford, Ray. “Short Term Planning of Manufacturing Capacity.” APICS 21st Annual Conference Proceedings, 1978, pp. 37–68.
46. Lee Hau L. and Corey Billington. 1992. “Managing Supply Chain Inventory” Sloan Management Review, Spring: 65–73.
47. Ahmed, I. and W.W. Fisher. 1992. “Due Date Assignment, Job Order Release and Sequencing” Decision Sciences, 23: 633–644.
48. Baker, K.R. 1974. Introduction to Sequencing and Scheduling, New York: Wiley.
49. Baker, K.R. and G.D. Scudder. December 1991. “Sequencing with Earliness and Tardiness Penalties: Part I” Computers and Operations Research, 38: 22–36.
50. Cambadi, B.V. December 1991. “One Machine Scheduling to Minimize Expected Mean Tardiness: Part I” Computers and Operations Research, 18(9): 787–796.
51. Conway, R.W., Maxwell, W.L., and L.W. Miller. 1967. Theory of Scheduling, Reading, MA: Addison-Wesley.
52. Fathi, Y. and H.W.L. Nuttle. September 1990. “Heuristics for the common Due Date Weighted Tardiness Problem” IIE Transactions, 22: 215–225.
53. Hall, N.G., Kubiak, W., and S. Sethi. September–October 1991. “Weighted Deviation of Completion Times about a Restrictive Common Due Date” Operations Research, 39: 847–856.
54. Hall, N.G. and M.E. Posner. September–October 1991. “Weighted Deviation of Completion Times about a Common Due Date” Operations Research, 39: 836–846.
55. Johnson, L.A. and D.C. Montgomery. 1974. Operations Research in Production Planning, Scheduling and Inventory Control, New York: Wiley.
56. Lee, C.Y., Danusaputro, S.L., and C.S. Lin. 1991. “Minimizing Weighted Number of Tardy Jobs and Weighted Earliness-Tardiness Penalties about a Common Due Date” Computers and Operations Research, 379–389.
57. Ow, P.S. and T.E. Morton. February 1989. “The Single Machine Early/Tardy Problem” Management Science, 35: 177–187.
58. Pinedo, M. 1995. Scheduling Theory, Algorithms and Systems, Englewood Cliffs, NJ: Prentice Hall.
59. Srinivasan, V. 1971. “A Hybrid Algorithm for the One Machine Sequencing Problem to Minimize Total Tardiness” Naval Research Logistics Quarterly, 18: 317–127.
60. Sung, C.S. and U.G. Joo. November 1992. “A Single Machine Scheduling Problem with Earliness, Tardiness and Starting Time Penalties under a Common Due Date” Computers and Operations Research, 19(8): 757–766.
61. Ahmed, I. and W.W. Fisher. 1992. “Due Date Assignment, Job Order Release and Sequencing” Decision Sciences, 23: 633–644.
62. Baker, K.R. 1974. Introduction to Sequencing and Scheduling, New York: Wiley.
63. Cambadi, B. l991. “One Machine Scheduling to Minimize Expected Mean Tardiness: Part I” Computers and Operations Research, 22–36.
64. Conway, R.W., Maxwell, W.L., and L.W. Miller. 1967. Theory of Scheduling, Reading, MA: Addison-Wesley.
65. Eilon, S. and I.E. Chowdhury. 1977. “Minimizing Waiting Time Variance in the Single Machine problem” Management Science, 23(6): 567–575.
66. Elmaghraby, S.E. 1968. “The One-Machine Scheduling Problem with Delay Costs” Journal of Industrial Engineering, 19: 105–108.
67. Emmons, H. 1969. “One Machine Sequencing to Minimize Certain Functions of Job Tardiness” Operations Research, 17: 701–715.
68. Fathi, Y. and H.W.L. Nuttle. 1990. “Heuristic for Common Due Date Weighted Tardiness Problem” IIE Transactions, 22: 215–225.
69. Hamada, T. and K. D. Glazebrook. 1993. “A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flow Times of Jobs with Exponential Processing Times” Operations Research, 924.
70. Kanet, John J. December 1981. “Minimizing Variation of Flow Time in Single Machine Systems” Management Science, 27: 1453–1459.
71. Lawler, E.L. l973. “Optimal Sequencing of a Single Machine Subject to Precedence Constraints” Management Science, 19: 544–546.
72. Lee, C.Y., Danusaputro, S.L., and C.S. Lin. 1991. “Minimizing Weighted Number of Tardy Jobs and Weighted Earliness-Tardiness Penalties about a Common Due Date” Computers and Operations Research, 18(4): 379–389.
73. Merten, A.G. and M.E. Muller. 1972. “Variance Minimization in Single Machine Sequencing Problems” Management Science, 18(9): 518–528.
74. Mittenthal, J., M. Ragavachari, A.I. Rana. 1993. “AHybrid SimulatedAnnealingApproach for Single Machine Scheduling Problems with Non-Regular Penalty Functions” Computers and Operational Research, 103.
75. Moore, J.M. 1968. “An ’N’ Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs” Management Science, 15: 102–109.
76. Ow, P.S. and T.E. Morton. 1989. “The Single Machine Early/Tardy Problem” Management Science, 35: 177–187.
77. Panwalkar, S.S., Sluith, M.L., and A. Seidmann. 1982. “Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling problem” Operations Research, 30: 391–399.
78. Schrage, L. 1975. “Minimizing the Time-In System Variance for a Finite Jobset” Management Science, 21(5): 540–543.
79. Sundararaghavan, P.S. and M.U. Ahmed. 1984. “Minimizing the Sum of Absolute Lateness in Single-Machine and Multimachine Scheduling” Naval Research Logistics Quarterly, 31: 325–333.
80. Taha, H.A. 1987. Operations Research, New York: Macmillan.
81. Achugbue, J.O. and F.Y. Chin. November 1982. “Complexity and Solutions of Some Three-Stage Flowshop Scheduling Problems” Mathematics and Operations Research, 7(4): 532–544.
82. Campbell, H.G., Dudek, R.A., and M.L. Smith. 1970. “A Heuristic Algorithm for the ‘N’ Job ‘M’ Machine Sequencing Problem” Management Science, 16: B630–B637.
83. Johnson, S.M. 1954. “Optimal Two-and Three-Stage Production Schedules with Setup Times Included” Naval Research Logistics Quarterly, 1(1): 61–68.
84. Nawaz, M. 1983. “AHeuristicAlgorithm for the ‘M’-Machine, ‘N’-Job Flow-Shop Sequencing Problem” Management Science, 11(1): 91–95.
85. Palmer, D.S. 1965. “Sequencing Jobs through a Multi-Stage Process in the Minimum Total Time-AQuick Method of Obtaining a Near Optimum” Operations Research Quarterly, 16: 101–107.
86. Panwalker, S.S. 1991. “Scheduling of a Two-Machine Flowshop with Travel Time between Machines” Journal of Operations Research Society, 42(7): 609–613.
87. Pinedo, M. January-February 1982. “Minimizing the Expected Makespan in Stochastic Flow Shops” Operations Research, 30(1): 148–62.
88. Sule, D.R. 1982. “Sequencing ‘N’ Jobs on Two Machines with Setup, Processing and Removal Times Separated” Naval Research Logistics Quarterly, 29(3): 517–519.
89. Szwarc, W. December 1981. “Note on the Flow Shop Problem without Interruptions in Job Processing” Naval Research Logistics Quarterly, 28(4): 665–669.
90. Ashour, S., T.E. Moore, and K.V. Chiu. 1974. “An Implicit Enumeration Algorithm for the Nonpreemptive Shop Scheduling Problem” AIIE Transaction, 6: 62–72.
91. Barens, J.W. and L.K. Vanston. 1981. “Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs” Operations Research, 29(1): 146–160.
92. Bruno, J., and O. Downey. 1978. “Complexity of Task Sequencing with Deadlines, Setup Times and Changeover Costs” SIAM Journal of Computers, 7(4): 393–404.
93. Cheng, T.C.E. 1990. “A Note on a Partial Search Algorithm for the Single-Machine Optimal Common Due Date Assignment and Sequencing Problem” Computers and Operations Research, 17(3): 321–324.
94. Cho, Y. and S. Sahani. 1981. Preemptive Scheduling of Independent Jobs with Release and Due Dates in Operation Flow and Job Shops” Operation Research, 29(3): 511–522.
95. Crabill, T.B. and W.L. Maxwell. 1969. Single Machine Sequencing with Random Processing Times and Random Due Dates” Naval Research Logistics Quarterly, 6(4): 549–552.
96. Emmons, H. 1969. “One Machine Sequencing to Minimize Certain Functions of Job Tardiness” Operations Research, 17(4): 701–715.
97. Erschler, J., F. Roubellat, and J.P. Vernhes. 1980. “Characterizing the Set of Feasible Sequences for ‘N’Jobs to Be Carried Out on a Single Machine” European Journal of Operational Research, 4: 189–194.
98. Erschler, J., G. Fontan, C. Merce, and F. Roubellat. 1983. “A New Dominance Concept in Scheduling ‘N’ Jobs on a Single Machine with Ready Times and Due Dates” Operations Research, 31(1): 114–127.
99. Grabowski, J. 1980. “One Two-Machine Scheduling with Release and Due Dates to Minimize Maximum Lateness” Opsearch, 17(4): 133–154.
100. Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey” Annals of Discrete Mathematics, 5: 287–326.
101. Graves, S.C. 1981. “A Review of Production Scheduling” Operation Research, 29(4).
102. Gupta and Tunc. 1997. “Scheduling a two-stage hybrid flow shop with parallel machines at first stage” Annals of Operations Research, Vol. 69, Springer, Netherlands.
103. Laxminarayanan, L., L. Lakashmanan, R.L. Papineau, and R. Rochette. 1978. “Optimal Single Machine Scheduling with Earliness and Tardiness Penalties” Operation Research, 26(6): 1079–1082.
104. McMahon, G. and M. Florian. 1975. “One Machine Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness” Operation Research, 23(3): 475–482.
105. Monma, C.L. and C.N. Potts. 1989. “On the Complexity of Scheduling with Batch Setup Times” Operations Research, 37(5): 798–804.
106. Nakamura, N., T. Yoshida, and K. Hitomi. 1978. “Group Production Scheduling for Minimum Total Tardiness” Part I, AIIE Transection, 10(2): 152–162.
107. Posner, M.E. 1988. “The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic” Operations Research, 36(5): 742–746.
108. Ramasesh, R. 1990. Dynamic Job Shop Scheduling: A Survey of Simulation Research” Omega International Journal of Management Science, 18(1): 43–57.
109. Sahni, S. 1979. “Preemptive Scheduling with Due Dates” Operation Research, 27(5): 925–934.
110. Schrage, L. 1970. “Solving Resource-Constrained Network Problem by Implicit Enumeration-non-Preemptive case” Operation Research, 18: 263–278.
111. Sen, T. and R.K. Gupta. 1984. “A State of Art Survey of Static Scheduling Research Involving Due Dates” The International Journal of Science, 12(1): 67–76.
112. Sen, T.T. and L.M. Austin. 1980. An Efficient Algorithm for Minimizing Total Tardiness in the n-job, One Machine Sequencing Problem, Working Paper, College of Business Administration, Texas Tech. University, Luhbock, TX.
113. Shwimer, J. 1972. “On the n-Job, One-Machine, Sequence-Dependent Problem with Tardiness Penalties: A Branch-and-Bound Approach” Management Science, 18: B301–B313.
114. Sidney, J.B. 1977. “Optimal Single Machine Scheduling with Earliness and Tardiness Penalties” Operation Research, 25(7): 62–69.
115. Srinivasan, V. 1971. “A Hybrid Algorithm for the One-Machine Sequencing Problem to Minimize total Tardiness” Naval Research Logistics Quarterly, 18: 317–327.
116. Sule, D.R. and S. Saxena. 1992. “Batch Scheduling for Limited Capacity Fixed Period Process Problem” Production Planning and Control, 3(1): 47–52.
117. Tang, C.S. 1990. “Scheduling Batches on Parallel Machines with Major and Minor Setups” European Journal of Operational Research, 46(3): 171–175.
118. Unal, A.T. and A.S. Kiran. September 1992. “Batch Sequencing” IIE Transactions, 24(4): 73–83.
119. Wittock, R.J. 1986. “Scheduling Parallel Machines with Setups” Research Report, IBM Thomas J Watson Research Center, Yorktown Heights, NY.
120. Atabaksh, H. 1991. “A Survey of Constraint Based Scheduling Systems Using an Artificial Intelligence Approach” Artificial Intelligence in Engineering, 6(2): 58–73.
121. Baker, K.R. 1974. Introduction to Sequencing and Scheduling, New York: John Wiley & Sons.
122. Bard, J.F., A. Shtub, and S.B. Joshi. 1994. “Sequencing Mixed-Model Assembly Lines to Level Parts Usage and Minimize Line Length” International Journal of Production Research, 32(10): 2431–2454.
123. Blazewicz, J., W. Cellary, R. Slovinski, and J. Weglarz. 1986. “Scheduling under Resource Constraints-Deterministic Models” Annals of Operations Research, 7.
124. Burns, L., and C.F. Daganzo. 1987. “Assembly Line Job Sequencing Principles” International Journal of Production Research, 25, 71–99.
125. Dar-El, E.M. and A. Nadivi. 1981. “A Mixed-Model Sequencing Application” International Journal of Production Research, 19(1): 69–84.
126. Du, J. and J.Y.-T. Leung. 1989. “Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length” SIAM Journal of Discrete Mathematics, 2: 176–196.
127. Du, J., J.Y.-T. Leung, and G.H. Young. 1991. “Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time” Information and Computation, 92: 219–236.
128. Frostig, E. 1988. “A Stochasitc Scheduling Problem with Intree Precedence Constraints” Operations Research, 36: 937–943.
129. Hu, T.C. 1961. “Parallel Sequencing and Assembly Line Problems” Operations Research, 9: 841–848.
130. Kampke, T. 1989. “Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors” Operations Research, 37: 126–133.
131. Lenstra, J.K., A.H.G. Rinnooy Kan. 1978. “Computational Complexity of Scheduling under Precedence Constraints” Operations Research, 26: 22–35.
132. McCormick, S.T., M.L. Pinedo, S. Shenker, and B. Wolf. 1990. “Transient Behaviour in a Flexible Assembly System” International Journal of Flexible Manufacturing Systems, 3: 27–44.
133. McCormick, S.T., M.L. Pinedo, S. Sheker, and B. Wolf. 1989. “Sequencing in an Assembly Line with Blocking to Minimize Cycle Time” Operations Research, 37: 925–936.
134. Pinedo, M. 1995. Scheduling-Theory, Algorithms, and Systems, Englewood Cliffs, NJ: Prentice Hall.
135. Pinedo, M. and G. Weiss. 1984. “Scheduling Jobs with exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines” Operations Research, 33: 1381–1388.
136. Sule, D.R. 1992. Manufacturing Facilities-Location, Planning and Design, 2d ed. Boston: PWS Publishing.
137. Adams, J., Balas, E., and D. Zawack. (March 1988). “The Shifting Bottleneck Procedure for Job Shop Scheduling,” Management Science, 34 (3), 391–401.
138. Anderson, E.J., and J.C. Nyirenda. (1990). “Two New Rules to Minimize Tardiness in a Job Shop,” International Journal of Production Research, 28, 2277–2292.
139. Baker, K.R. (1984). “Sequencing Rules and Due-Date Assignments in a Job Shop,” Management Science, 30, 1093–1104.
140. Baker, K.R., and J.J. Kanet. (1983). “Job Shop Scheduling with Modified Due-Dates,” Journal of Operations Management, 4, 11–21.
141. Balas, E. (November 1969). “Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Algorithm,” Operations Research, 17, 941–957.
142. Bowman, F.H. (1959). “The Schedule-Sequencing Problem,” Operations Research, 7, 621–624.
143. Carlier, J. (1982). “The One Machine Sequencing Problem,” European Journal of Operations Research, 11, 42–47.
144. Conway, R.W. (1965). “Priority Dispatching and Job Lateness in a Job Shop,” Journal of Industrial Engineering, 16(4), 228–237.
145. Conway, R.W., Maxwell, W.L., and L. Miller. (1967). Theory of Scheduling, Addison-Wesley, Reading, MA.
146. Eilon, S., and I.G. Chowdhury (1976). “Due Dates in Job Shop Scheduling,” International Journal of Production Research, 14 (2), 223–237.
147. Eilon, S., and D.J. Cotterill. (1968). “A Modified SI Rule in Job Shop Scheduling,” International Journal of Production Research, 7, 135–145.
148. Eilon, S., and R.M. Hodgson. (1967): “Job Shop Scheduling with Due Dates,” International Journal of Production Research, 6, 1–13.
149. Elvers, D.A. (1973). “Job Shop Dispatching Using Various Due Date Setting Criteria,” Production and Inventory Management, 14(4), 62–69.
150. Manne, A.S. (1960). “On the Job-Shop Scheduling Problem,” Operations Research, 8, 219–223.
151. Muth, J.F., and G.L. Thompson. (1963). “Industrial Scheduling,” Prentice Hall, Englewood Cliffs, NJ.
152. Nasr, N., and E.A. Elsayed, (1990). “Job Shop Scheduling with Alternative Machines,” International Journal of Production Research, 28(9), 1594–1609.
153. Schultz, C.R. (1989). “An Expediting Heuristic for the Shortest Processing Time Dispatching Rule,” International Journal of Production Research, 27, 31–41.
154. Spachis, A.S., and J.R. King. (1979). “Job Shop Scheduling Heuristics with Local Neighborhood Search,” International Journal of Production Research, 17(6), 507–526.
155. Vancheeswaran, R., and M.A. Townsend. (1993). “TwoStage Heuristic Procedure for Scheduling Job Shops,” Journal of Manufacturing Systems, 12 (4), 315–325.
156. Adiri, I. and N. Amit. September 1983. “Route Dependent Open Shop Scheduling” IIE Transactions, 15(3): 231–234.
157. Atwater, F.S., L.L. Bethel, G. Smith, and H.A. Stackman. 1959. Essentials of Industrial Management, 2d ed., New York: McGraw-Hill.
158. Choo, Y. and S. Sahni. May-June, 1981. “Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops” Operations Research Journal, 29(3): 511–522.
159. Conway, R.W., W.L. Maxwell, and L.W. Miller. 1967. Theory of Scheduling, Reading, MA: Addison-Wesley.
160. Gonzalez, T. and S. Sahni. 1976. “Open Shop Scheduling to Minimize Finish Times” Journal of the Association for Computing Machinery, 23: 665–679.
161. Liu, C.-Y. and R.L. Bulfin. July-August, 1988. “Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates” Operations Research Journal, 14(3): 257–264.
162. Lin, H.-F., C.-Y. Liu, and P.-Y. Liu. 1955. “A Heuristic Approach to the Total Tardiness in Non-Preemptive Open-Shop Scheduling” International Journal of Industrial Engineering, 2: 25–33.
163. Pinedo, M. 1955. Scheduling: Theory, Algorithms, and Systems, Englewood Cliffs, NJ: Prentice Hall.
164. Alfares H.K 2003 “Four-Day Workweek Scheduling with two or three Consecutive Days off”, Journal of mathematical modeling and Algorithms, Vol 2, Number 1, 2003 pp 67–80
165. Bailey, J. 1985. “Integrated Days-Off and Shift Personnel Scheduling” Journal of Computers and Industrial Engineering, 9(4): 395–404.
166. Baker, K.R. 1974. “Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements” Management Science, 20(12): 1561–1568.
167. Baker, K.R., R.N. Burns, and M.W. Carter. 1979. “Staff Scheduling with Day-Off and Workstretch Constraints” AIIE Transactions, 11(4): 286–292.
168. Baker, K.R. and M.J. Magazine. 1977. “Workforce Scheduling with Cyclic Demands and Day-Off Constraints” Management Science, 24(2): 161–167.
169. Bechtold, S.E. 1981. “Workforce Scheduling for Arbitrary Cyclic Demands” Journal of Operations Management, 1(4): 155–167.
170. Bechtold, S.E. and M.J. Showalter. 1987. “A Methodology for Labor Scheduling in a Service Operating System” Decision Sciences, 18(1): 89–107.
171. Burns, R.N. and M.W. Carter. 1985. “Workforce Size and Single Shift Schedules with Variable Demands” Management Sciences, 31(5): 599–607.
172. Emmons, H. 1985. “Workforce Scheduling with Cyclic Requirements and Constraints on Days Off, Weekends Off, and Workstretch” IIE Transactions, 17(1): 8–16.
173. Wang James 2005, “On 4 days on 3 days off schedule”, Louisiana Teen term paper.
174. Bard, J.F. 1988. “A Heuristic for Minimizing the Number of Tool Switches on a Flexible Machine” IIE Transactions, 20: 382–391.
175. Potts, C.N. and L.N. Van Wassenhove. 1991. “Single Machine Tardiness Sequencing Heuristic” IIE Transactions, 23: 346–354.
176. Sule, D.R. 1989. “A Systematic Approach for Machine Cell Formation in Cellular Manufacturing” Proceedings, International Industrial Engineering Conference, Toronto, pp. 619–624.
177. Sule, D.R. 1993. “Job Sequencing to Minimize Tool Changeover in Flexible Manufacturing” International Journal of Production Planning and Control, 4: 46–53.
178. Sule, D.R. 1994. Manufacturing Facilities: Location, Planning and Design, 2d ed., Boston: PWS Publishing.
179. Bridges, R.O. 1977. “Sequencing of Components for Automatic Assembly on Printed Wiring Boards” Western Electric Engineer, 21(14).
180. Fathi, Y. and J. Taheri. 1989. “A Mathematical Model for Loading the Sequencers in a Printed Circuit Pack Manufacturing Environment” International Journal of Production Research, 27(8): 1305–1316.
181. Richerson, F.K. 1976. “Computer Program Controls Component Sequencer Costs” Assembly Engineering, 24(24).
182. Sabah, U.R., Edward, D.M., and S.-D. Faruqui. 1985. “An Integer Programming Application to Solve Sequencer Mix Problems in Printed Circuit Board Production” International Journal of Production Research, 23(3): 543–561.
183. Sule, D.R. “A Systematic Approach for Machine Grouping in Cellular Manufacturing” Proceedings of the International Industrial Engineering Conference, 1989, Toronto, pp. 619–624.
184. Ahmadi, J., S. Grotzinger, and D. Johnson. 1988. “Component Allocation and Partitioning for a Dual Delivery Placement Machine” Operations Research, 36(2): 176–191.
185. Ball, M.O. and J.M. Magazine. 1988. “Sequencing of Insertions in Printed Circuit Assembly” Operations Research, 36(2): 192–201.
186. Carmon, T., O.Z. Maimon, and M.E. Darel. 1989. “Group Setup for PCB Assembly” International Journal of Production Research, 27(10): 1795–1810.
187. Cunningham, P. and J. Brown. 1986. “A Lisp Based Heuristic Scheduler for Automatic Insertion in Electronics Assembly” International Journal of Production Research, 24(6): 1395–1408.
188. Fathi, Y. and J. Taheri. 1989. “A Mathematical Model for Loading the Sequencers in a Printed Circuit Pack Manufacturing Environment” International Journal of Production Research, 27(8): 1305–1316.
189. Maimon, O.Z. 1991. “Grouping Methods for PCB Assembly” International Journal of Production Research, 29(7): 1379–1390.
190. Randhwa, U.S., D.E. McDowell, and S. Faruqui. 1985. “An Integer Programming Application to Solve Sequencer Mix Problems in PCB Production” International Journal of Production Research, 23(3): 543–552.
191. Sule, D.R. 1992. “A Heuristic Procedure for Component Scheduling in Printed Circuit Pack Sequencer” International Journal of Production Research, 30(5): 111–118.
192. Nawaz, M., E.E. Enscore Jr., and I. Ham. 1983. “A Heuristic Algorithm for the m-Machine, n-Job Flow-shop Sequencing Problem” Omega, 11(1): 91–95.
193. Schaller, J. 2000. “A Comparison of Heuristics for Family and Job Scheduling in a Flow-Line Manufacturing Cell” International Journal of Production Research, 38(2): 287–308.
194. Skorin-Kapov, J. and A.J. Vakharia. 1993.“Scheduling a Flow-Line Manufacturing Cell: A Tabu Search Approach” International Journal of Production Research, 31(7): 1721–1734.
195. Wemmerlov, U. and A.J. Vakharia. 1991. “Job and Family Scheduling of a Flow-Line Manufacturing Cell: A Simulation Study” IIE Transactions, 23(4): 383–393.
196. Yang, D.-L. and M.-S. Chern. 2000 “Two-Machine Flowshop Group Scheduling Problem” Computers and Operations Research, 27: 975–985.