Principles of Sequencing and Scheduling

Principles of Sequencing and Scheduling

Volumn , Issue , 2009, Pages 1-493

  Baker, Kenneth R ^a   Trietsch, Dan ^b  

^a DARTMOUTH COLLEGE   (United States)

^b AMERICAN UNIVERSITY OF ARMENIA   (Armenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70649088049     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470451793     Document Type: Book

References (274)

1. Baker, K.R. (1974). Introduction to Sequencing and Scheduling, Wiley, Hoboken, NJ.
2. Baker, K.R. (2005). Elements of Sequencing and Scheduling, Tuck School of Business, Hanover, NH.
3. Baker, K.R. and D. Trietsch (2007). Safe scheduling, Chapter 5 in Tutorials in Operations Research ( T. Klastorin, ed.), INFORMS, pp. 79-101.
4. Coffman, E.G. (1976). Computer and Job-shop Scheduling Theory, Wiley, Hoboken, NJ.
5. Conway, R.W., W.L. Maxwell, and L.W. Miller (1967). Theory of Scheduling, Addison-Wesley, Reading, MA.
6. French, S. (1982). Sequencing and Scheduling, Ellis Horwood, Ltd., Chichester, UK.
7. Garey, M.R. and D.S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
8. Morton, T.E. and D.W. Pentico (1993). Heuristic Scheduling Systems, Wiley, Hoboken, NJ.
9. Muth J.F. and G.L. Thompson (1963). Industrial Scheduling, Prentice Hall, Englewood Cliffs, NJ.
10. Pinedo, M. (2001). Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Upper Saddle River, NJ.
11. Trietsch, D. (1993). Scheduling flights at hub airports, Transportation Research, Part B (Methodology) 27B, 133-150.
12. Baker, K.R. and J.W.M. Bertrand (1981). A comparison of due date selection rules, AIIE Transactions 13, 123-131.
13. Maxwell, W.L. (1970). On the generality of the equation L = λW, Operations Research 18, 172-174.
14. Moore, J.M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15, 102-109.
15. Rau, J.G. (1973). Selected comments concerning optimization theory for functions of permutations, in Symposium on the Theory of Scheduling and Its Applications ( S. E. Elmaghraby, ed.), Springer-Verlag, New York.
16. Smith, W.E. (1956). Various optimizers for single stage production, Naval Research Logistics Quarterly 3, 59-66.
17. Elmaghraby, S.E. (1968). The one-machine sequencing problem with delay costs, Journal of Industrial Engineering 19, 105-108.
18. Emmons, H. (1969). One-machine sequencing to minimize certain functions of job tardiness, Operations Research 17, 701-715.
19. Lawler, E.L. (1973). Optimal sequencing of a single machine subject to precedence constraints, Management Science 19, 544-546.
20. Lawler, E.L. (1977). A "pseudopolynomial" algorithm for sequencing jobs to minimize total tardiness, Annals of Discrete Mathematics 1, 331-342.
21. Mitten, L.G. (1970). Branch and bound methods: general formulation and properties, Operations Research 18, 24-34.
22. Rau, J.G. (1971). Minimizing a function of permutations of n integers, Operations Research 19, 237-239.
23. Rinnooy Kan, A.H.G., J.K. Lenstra, and B.J. Lageweg (1975). Minimizing total costs in one machine scheduling, Operations Research 23, 908-927.
24. Schrage, L.E. and K.R. Baker (1978). Dynamic programming solution of sequencing problems with precedence constraints, Operations Research 26, 444-449.
25. Shwimer, J. (1972). On the n-job, one-machine, sequence-independent scheduling problem with tardiness penalties: a branch and bound solution, Management Science 18, 301-313.
26. W. Szwarc, A. Grosso, and F. Della Croce (2001). Algorithmic paradoxes of the single machine total tardiness problem, Journal of Scheduling 4, 93-104.
27. Baker, K.R. and J.W.M. Bertrand (1982). A dynamic priority rule for scheduling against due-dates, Journal of Operations Management 3, 37-42.
28. Glover, F. (1989). Tabu search-Part I, ORSA Journal on Computing 1, 190-203.
29. Kanet, J.J. and X. Li (2004). A weighted modified due date rule for sequencing to minimize weighted tardiness, Journal of Scheduling 7, 261-276.
30. Kirkpatrick, S., C.D. Gelatt, and M.P. Vecchi (1983). Optimization by simulated annealing, Science 220, 671-680.
31. Morton, T.E. and D.W. Pentico (1993). Heuristic Scheduling Systems, Wiley, Hoboken, NJ.
32. Potts, C.N. and L.N. VanWassenhove (1991). Single machine tardiness sequencing heuristics, IIE Transactions 23, 346-354.
33. Rachamadugu, R.M.V. (1987). Anote on the weighted tardiness problem, Operations Research 35, 450-452.
34. Rinnooy Kan, A.H.G., J.K. Lenstra, and B.J. Lageweg (1975). Minimizing total costs in one machine scheduling, Operations Research 23, 908-927.
35. Van Laarhoven, P.J.M. and E.H.L. Aarts (1987). Simulated Annealing: Theory and Applications, Reidel, Dordrecht, The Netherlands.
36. Bagchi, U., Y. Chang, and R. Sullivan (1987). Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date, Naval Research Logistics Quarterly 33, 227-240.
37. Baker, K.R. and G.D. Scudder (1990). Sequencing with earliness and tardiness penalties: a review, Operations Research 38, 22-36.
38. Cheng, T.C.E. (1984). Optimal due date determination and sequencing of n jobs on a single machine, Journal of Operational Research Society 35, 433-437.
39. De, P., J. Ghosh, and C. Wells (1989). A note on the minimization of mean squared deviation of completion times about a common due date, Management Science 35, 1143-1147.
40. Fry, T., R. Armstrong, and J. Blackstone (1987). Minimizing weighted absolute deviation in single machine scheduling, IIE Transactions 19, 445-450.
41. Hall, N. and M. Posner (1991). Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date, Operations Research 39, 836-846.
42. Hall, N., W. Kubiak, and S. Sethi (1991). Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date, Operations Research 39, 847-856.
43. Hassin, R. and M. Shani (2005). Machine scheduling with earliness, tardiness and nonexecution penalties, Computers & Operations Research 32, 683-705.
44. Kanet, J. (1981). Minimizing the average deviation of job completion times about a common due date, Naval Research Logistics Quarterly 28, 643-651.
45. Kanet, J. (1981). Minimizing variation of flow time in single machine systems, Management Science 27, 1453-1459.
46. Raghavachari, M. (1986). A V-shape property of optimal schedule of jobs about a common due date, European Journal of Operations Research 23, 401-402.
47. Sundararaghavan, P. and M. Ahmed (1984). Minimizing the sum of absolute lateness in singlemachine and multimachine scheduling, Naval Research Logistics Quarterly 31, 325-333.
48. Szwarc, W. (1989). Single machine scheduling to minimize absolute deviation of completion times from a common due date, Naval Research Logistics Quarterly 36, 663-673.
49. Szwarc, W. and S.K. Mukhopadhyay (1995). Optimal timing schedules in earliness-tardiness single machine sequencing, Naval Research Logistics Quarterly 42, 1109-1114.
50. Esary, J.D., F. Proschan, and D.W. Walkup (1967). Association of random variables, with applications, Annals of Mathematical Statistics 38, 1466-1474.
51. Gutjahr, W.J, A. Hellmayr, and G.Ch. Pflug (1999). Optimal stochastic single-machinetardiness scheduling by stochastic branch-and bound, European Journal of Operational Research 117, 396-413.
52. Hodgson, T.J. (1977). A note on single machine sequencing with random processing times, Management Science 23, 1144-1146.
53. Moore, J.M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15, 102-109.
54. Ross, S.M. (1996). Stochastic Processes, 2nd ed., Wiley, Hoboken, NJ.
55. Trietsch, D. (2005). The effect of systemic errors on optimal project buffers, International Journal of Project Management 23, 267-274.
56. Akker, J.M. van den and J.A. Hoogeveen (2008). Minimizing the number of late jobs in a stochastic setting using a chance constraint, Journal of Scheduling 11, 59-69.
57. Baker, K.R. and D. Trietsch (2007). Safe scheduling, Chapter 5 in Tutorials in Operations Research (T. Klastorin, ed.), INFORMS, November 2007.
58. Baker, K.R. and D. Trietsch (2009). Safe scheduling: setting due dates in single-machine problems, European Journal of Operational Research 196, 69-77.
59. Balut, S.J. (1973). Scheduling to minimize the number of late jobs when set-up and processing times are uncertain, Management Science 19, 1283-1288.
60. Cai, X. and S. Zhou (1996). Scheduling stochastic jobs with asymmetric earliness and tardiness penalties, Naval Research Logistics 44, 531-557.
61. Dodin, B. (1996). Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops, Computers and Operations Research 23, 829-843.
62. Kise, H. and T. Ibaraki (1983). On Balut's algorithm and NP-completeness for a chance constrained scheduling problem, Management Science 29, 384-388.
63. Portougal, V. and D. Trietsch (1998). Makespan-related criteria for comparing schedules in stochastic environments, Journal of the Operational Research Society 49, 1188-1195.
64. Portougal, V. and D. Trietsch (2006). Setting due dates in a stochastic single machine environment, Computers & Operations Research 33, 1681-1694.
65. Soroush, H.M. and L.D. Fredendall (1994). The stochastic single machine scheduling problem with earliness and tardiness costs, European Journal of Operational Research 77, 287-302.
66. Soroush, H.M. (1999). Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs, European Journal of Operational Research 113, 450-468.
67. Trietsch, D. (1993). Scheduling flights at hub airports, Transportation Research, Part B (Methodology) 27B, 133-150.
68. Trietsch, D. and K.R. Baker (2008). Minimizing the number of tardy jobs with stochasticallyordered processing times, Journal of Scheduling 11, 71-73.
69. Yano, C.A. (1987). Setting planned leadtimes in serial production systems with tardiness costs, Management Science 33, 95-106.
70. Yano, C.A. (1987). Planned leadtimes for serial production systems, IIE Transactions 19, 300-307.
71. Ahmadi, R. and U. Bagchi (1990). Lower bounds for the single-machine scheduling problem, Naval Research Logistics 37, 967-979.
72. Applegate, D.L., R.E. Bixby, V. Chvatal, and W.J. Cook (2007). The Traveling Salesman Problem, Princeton University Press, Princeton, NJ.
73. Baker, K.R. and Z. Su (1974). Sequencing with due-dates and early start times to minimize maximum tardiness, Naval Research Logistics Quarterly 21, 171-176.
74. Carlier, J. (1982). The one machine sequencing problem, European Journal of Operational Research 11, 42-47.
75. Chandra, R. (1979). On n/1/-F dynamic deterministic problems, Naval Research Logistics Quarterly 26, 537-544.
76. Chu, C. (1992). A branch-and-bound algorithm to minimize total tardiness with different release dates, Naval Research Logistics Quarterly 39, 265-283.
77. Chu, C. (1992). Efficient heuristics to minimize total flow time with release dates, Operations Research Letters 12, 321-330.
78. Chu, C. and M.-C. Portmann (1992). Some new efficient methods to solve the n/1/ri /Ti scheduling problem, European Journal of Operational Research 58, 404-413.
79. Gapp, W., D.S. Mankekar, and L.G. Mitten (1965). Sequencing operations to minimize inprocess inventory costs, Management Science 11, 476-484.
80. Gavett, J.W. (1965). Three heuristic rules for sequencing jobs to a single production facility, Management Science 11, B166-B176.
81. Hodgson, T.J. (1977). A note on single machine sequencing with random processing times, Management Science 23, 1144-1146.
82. John, T.C. and Y.B. Wu (1987). Minimum number of tardy jobs in single-machine scheduling with release dates-an improved algorithm, Computers and Industrial Engineering 12, 223-230.
83. Jonker, R. and T. Volgenant (1983). Transforming asymmetric into symmetric traveling salseman problems, Operations Research Letters 2, 161-163.
84. Karg, R. and G.L. Thompson (1964). A heuristic approach to solving travelling salesman problems, Management Science 10, 225-248.
85. Kise, H., T. Ibaraki, and H. Mine (1978). A solvable case of the one-machine scheduling problem with ready and due-times, Operations Research 26, 121-126.
86. Lageweg, B.J., J.K. Lenstra, and A.H.G. Rinnooy Kan (1976). Minimizing maximum lateness on one machine: computational experience and some applications, Statistica Neerlandica 30, 25-41.
87. Laporte, G. (1992). The traveling salesman problem: an overview of exact and approximate algorithms, European Journal of Operational Research 59, 231-247.
88. Laporte, G., F.V. Louveaux, and H.Mercure (1992). The vehicle routing problem with stochastic travel times. Transportation Science 26, 161-170.
89. Lawler, E.L. (1973). Optimal sequencing of a single machine subject to precedence constraints, Management Science 19, 544-546.
90. Lawler, E.L. (1978). Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Annals of Discrete Mathematics 2, 75-90.
91. Little, J.D.C., K.G. Murty, D.W. Sweeny, and C. Karel (1963). An algorithm for the traveling salesman problem, Operations Research 11, 972-989.
92. McMahon, G. and M. Florian (1975). On scheduling with release dates and due dates to minimize maximum lateness. Operations Research 23, 475-482.
93. Monma, C.L. and J.B. Sidney, (1979). Sequencing with series-parallel precedence constraints, Mathematics of Operations Research 4, 215-224.
94. Monma, C.L. (1981). Sequencing with general precedence constraints, Discrete AppliedMathematics 3, 137-150.
95. Morton, T.E. and B.G. Dharan (1978). Algoristics for single-machine sequencing with precedence constraints, Management Science 24, 1011-1020.
96. Portougal, V. and D. Trietsch (2001). Stochastic scheduling with optimal customer service, Journal of the Operational Research Society 52, 226-233.
97. Potts, C.N. (1980). Analysis of a heuristic for one machine sequencing with release dates and delivery times, Operations Research 28, 1436-1441.
98. Sidney, J.B. (1975). Decomposition algorithms for single machine sequencingwith precedence relations and deferral costs, Operations Research 23, 283-298.
99. Baker, K.R. and Merten, A.G. (1973). Scheduling with parallel processors and linear delay costs, Naval Research Logistics Quarterly 20, 793-804.
100. Cheng, T.C.E. and C.C.S. Sin (1990). A state-of-the-art review of parallel-machine scheduling research, European Journal of Operational Research 47, 271-292.
101. Conway, R.W., W.L. Maxwell, and L.W. Miller (1967). Theory of Scheduling, Addison-Wesley, Reading, MA.
102. Coffman, E.G., M.R. Garey, and D.S. Johnson (1978). An application of bin packing to multiprocessor scheduling, SIAM Journal of Computing 7, 1-17.
103. Coffman, E.G. and R.L. Graham (1972). Optimal scheduling for two processor systems, Acta Informatica 1, 200-213.
104. Dobson, G. (1984). Scheduling independent tasks on uniform processors, SIAM Journal of Computing 13, 705-716.
105. Eastman, W.L., S. Even, and I.M. Isaacs (1964). Bounds for the optimal scheduling of n jobs on m processors, Management Science 11, 268-279.
106. Friesen, D.K. andM.A. Langston (1986). Evaluation of a multifit-based scheduling algorithm, Journal of Algorithms 7, 35-59.
107. Graham, R.L. (1969). Bounds on multiprocessor timing anomalies, SIAM Journal of Applied Mathematics 17, 416-425.
108. Hu, T.C. (1961). Parallel sequencing and assembly line problems, Operations Research 9, 841-848.
109. Kao, T.Y. and E.A. Elsayed (1990). Performance of the LPT algorithm in multiprocessor scheduling, Computers and Operations Research 17, 365-373.
110. Lam, S. and R. Sethi (1977). Worst case analysis of two scheduling algorithms, SIAM Journal of Computing 6, 518-536.
111. Lee, C.-Y. (1991). Parallel machines scheduling with nonsimultaneous machine available time, Discrete Applied Mathematics 30, 53-61.
112. Lee, C.-Y. and J.D. Massey (1988). Multiprocessor scheduling: combining LPT and multifit, Discrete Applied Mathematics 20, 233-242.
113. McNaughton, R. (1959). Scheduling with deadlines and loss functions, Management Science 6, 1-12.
114. Portougal, V. (1993). Asymptotic behavior of some scheduling algorithms, Asia-Pacific Journal of Operational Research 10, 71-91.
115. Root, J.G. (1965). Scheduling with deadlines and loss functions on k parallel machines, Management Science 11, 460-475.
116. Rothkopf, M.H. (1966). Scheduling independent tasks on parallel processors, Management Science 12, 437-447.
117. Burns, F. and J. Rooker (1976). Johnson's three-machine flow shop conjecture, Operations Research 24, 578-580.
118. Burns, F. and J. Rooker (1978). Three stage flow shops with regressive second stage, Operations Research 26, 207-208.
119. Campbell, H.G., R.A. Dudek, and M.L. Smith (1970). A heuristic algorithm for the n-job, m-machine sequencing problem, Management Science 16, 630-637.
120. Dannenbring, D. (1977). An evaluation of flow shop sequencing heuristics, Management Science 23, 1174-1182.
121. Gilmore, P.C. and R.E. Gomory (1964). Sequencing a one state-variable machine: a solvable case of the traveling salesman problem, Operations Research 12, 655-679.
122. Ignall, E. and L.E. Schrage (1965). Application of the branch and bound technique to some flow shop scheduling problems, Operations Research 13, 400-412.
123. Johnson, S.M. (1954). Optimal two-and three-stage production schedules with setup times included, Naval Research Logistics Quarterly 1, 61-68.
124. Lageweg, B.J., J.K. Lenstra, and A.H.G. Rinnooy Kan (1978). A general bounding scheme for the permutation flow shop, Operations Research 26, 53-67.
125. Lai, T.-C. (1996). A note on heuristics of flow shop scheduling, Operations Research 44, 648-652.
126. Mitten, L.G. (1959). Sequencing n jobs on two machines with arbitrary time lags, Management Science 5, 293-298.
127. Monma, C. and A.H.G. Rinnooy Kan (1983). A concise survey of efficiently solvable special cases of the permutation flow-shop problem, RAIRO Recherche Operationelle 17, 105-119.
128. Nawaz, M., E. Enscore, and I. Ham (1983). A heuristic algorithm for the m-machine n-job flow-shop sequencing problem, Omega 11, 91-95.
129. Osman, I.H. and C.N. Potts (1989). Simulated annealing for permutation flow-shop scheduling, Omega 17, 551-557.
130. Palmer, D.S. (1965). Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum, Operational Research Quarterly 16, 101-106.
131. Panwalkar, S.S. and C.R. Woolam (1980). Ordered flow shop problems with no in-process waiting: further results, Journal of the Operational Research Society 30, 1039-1043.
132. Portougal, V. and J.L. Scott (2001). The asymptotic convergence of some flow-shop scheduling heuristics, Asia-Pacific Journal of Operational Research 18, 243-256.
133. Potts, C.N., D.B. Shmoys, and D.P. Williamson (1991). Permutation vs non-permutation flow shop schedules, Operations Research Letters 10, 281-284.
134. Reeves, C.R. (1993). Improving the efficiency of tabu search for machine sequencing problems, Journal of the Operational Research Society 44, 375-382.
135. Smith, M.L., S.S. Panwalkar, and R.A. Dudek (1976). Flow shop sequencing problems with ordered processing time matrices: a general case, Naval Research Logistics Quarterly 23, 481-486.
136. Smits, A.J.M. and K.R. Baker (1981). An experimental investigation of the occurrence of special cases in the three-machine flowshop problem, International Journal of Production Research 19, 737-741.
137. Szwarc,W. (1977). Optimal two machine orderings in the 3 × n flowshop problem, Operations Research 25, 70-77.
138. Szwarc, W. (1983). Flow shop problems with time lags, Management Science 29, 477-481.
139. Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research 47, 65-74.
140. Wismer, D.A. (1972). Solution of the flow shop scheduling problem with no intermediate queues, Operations Research 20, 689-697.
141. Clark, C.E. (1961). The greatest of a finite set of random variables, Operations Research 9, 145-162.
142. Cunningham, A.A. and S.K. Dutta (1973). Scheduling jobs with exponentially distributed processing times on two machines of a flow shop, Naval Research Logistics Quarterly 16, 69-81.
143. Dodin, B. (1996). Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops, Computers&Operations Research 23, 829-843.
144. Johnson, S.M. (1954). Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly 1, 61-68.
145. Kamburowski, J. (1999). Stochastically minimizing the makespan in two-machine flow shops without blocking, European Journal of Operational Research 112, 304-309.
146. Kamburowski, J. (2000). Non-bottleneck machines in three-machine flow shops, Journal of Scheduling 3, 209-223.
147. Ku, P.-S. and S.-C. Niu (1986). On Johnson's two-machine flow shop with random processing times, Operations Research 34, 130-136.
148. Makino, T. (1965). On a scheduling problem, Journal of the Operations Research Society Japan 8, 32-44.
149. Pinedo, M. (1982). Minimizing the expected makespan in stochastic flow shops, Operations Research 30, 148-162.
150. Portougal, V. and D. Trietsch (1998). Makespan-related criteria for comparing schedules in stochastic environments, Journal of the Operational Research Society 49, 1188-1195.
151. Portougal, V. and D. Trietsch (2001). Stochastic scheduling with optimal customer service, Journal of the Operational Research Society 52, 226-233.
152. Portougal, V. and D. Trietsch (2006). Johnson's problem with stochastic processing times and optimal service level, European Journal of Operational Research 169, 751-760.
153. Talwar, P.P. (1967). A note on sequencing problems with uncertain job times, Journal of the Operations Research Society Japan 9, 93-97.
154. Baker, K.R. (1995). Lot streaming in the two-machine flow shop with setup times, Annals of Operations Research 57, 1-11.
155. Baker, K.R. and D.F. Jia (1993). A comparative study of lot streaming procedures, Omega 21, 561-566.
156. Baker, K.R. and D.F. Pyke (1990). Solution procedures for the lot streaming problem, Decision Sciences 21, 475-491.
157. Chang, J.H. and H.N. Chiu (2005). A comprehensive review of lot streaming, International Journal of Production Research 43, 1515-1536.
158. Chen, J. and G. Steiner (1996). Lot streaming with detached setups in three-machine flow shops, European Journal of Operational Research 96, 591-611.
159. Chen, J. and G. Steiner (1998). Lot streaming with attached setups in three-machine flow shops, IIE Transactions 30, 1075-1084.
160. Glass, C.A., J.N.D. Gupta, and C.N. Potts (1994). Lot streaming in three-stage production processes, European Journal of Operational Research 75, 378-394.
161. Glass, C.A. and C.N. Potts (1998). Structural properties of lot streaming in a flow shop, Mathematics of Operations Research 23, 624-639.
162. Goyal, S.K. (1976). Note on "Manufacturing cycle time determination for a multi-stage economic production quantity model," Management Science 23, 332-333 and the rejoinder, 334-338.
163. Kulonda,D.J. (1984). Overlapping operations-a step toward just-in-time production, in Readings in Zero Inventory, APICS 27th Annual International Conference, pp. 78-80.
164. Potts, C.N. and K.R. Baker (1989). Flow shop scheduling with lot streaming, Operations Research Letters 8, 297-303.
165. Sen, A., E. Topaloglu, and O.S. Benli (1998). Optimal streaming of a single job in a two-stage flow shop, European Journal of Operational Research 110, 42-62.
166. Smunt, T.L., A.H. Buss, and D.H. Kropp (1996). Lot splitting in stochastic flow shop and job shop environments, Decision Sciences 27, 215-238.
167. Szendrovits, A.Z. (1975). Manufacturing cycle time determination for a multi-stage economic production quantity model, Management Science 22, 298-308.
168. Trietsch, D. (1989). Polynomial transfer lot sizing techniques for batch processing on consecutive machines, Technical Report NPS-54-89-011, Naval Postgraduate School, Monterey, CA.
169. Trietsch, D. and K.R. Baker (1993). Basic techniques for lot streaming, Operations Research 41, 1065-1076.
170. Truscott, W.G. (1985). Scheduling production activities in multi-stage batch manufacturing systems, International Journal of Production Research 23, 315-328.
171. Ahmadi, J.H., R.H. Ahmadi, S. Dasu, and C.S. Tang (1992). Batching and scheduling jobs on batch and discrete processors, Operations Research 39, 750-763.
172. Albers, S. and P. Brucker (1993). The complexity of one-machine batching problems, Discrete Applied Mathematics 47, 87-107.
173. Bruno, J. and P. Downey (1978). Complexity of task sequencing with deadlines, setup times and changeover costs, SIAM Journal of Computing 7, 393-404.
174. Bruno, J. and R. Sethi (1978). Task sequencing in a batch environment with setup times, Foundations of Control Engineering 3, 105-117.
175. Chandru, V., C.Y. Lee, and R. Uzsoy (1993). Minimizing total completion time on batch processing machines, International Journal of Production Research 31, 2097-2122.
176. Coffman, E.G., M. Yannakakis, M.J. Magazine, and C. Santos (1990). Batch sizing and job sequencing on a single machine, Annals of Operations Research 26, 135-147.
177. Dobson, G., U.S. Karmarkar, and J.L. Rummel (1987). Batching to minimize flow times on one machine, Management Science 33, 784-799.
178. Gupta, J.N.D. (1988). Single facility scheduling with multiple job classes, European Journal of Operational Research 33, 42-45.
179. Ikura, Y. and M. Gimple (1986). Efficient scheduling algorithms for a single batch processing machine, Operations Research Letters 5, 61-65.
180. Lee, C.Y., R. Uzsoy, and L.A. Martin-Vega (1992). Efficient algorithms for scheduling semiconductor burn-in operations, Operations Research 40, 764-775.
181. Mason, A.J. and E.J. Anderson (1991). Minimizing flow time on a single machine with job classes and setup times, Naval Research Logistics 38, 333-350.
182. Monma, C.L. and C.N. Potts (1989). On the complexity of scheduling with batch setup times, Operations Research 37, 798-804.
183. Potts, C.N. and L.W. Van Wassenhove (1992). Integrating scheduling with batching and lotsizing:a review of algorithms and complexity, Journal of the Operational Research Society 43, 395-406.
184. Santos, C. and M. Magazine (1985). Batching in single operation manufacturing systems, Operations Research Letters 4, 99-103.
185. Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes, International Journal of Production Research 32, 1615-1635.
186. Adams, J., E. Balas, and D. Zawack (1988). The shifting bottleneck algorithm for job-shop scheduling, Management Science 34, 391-401.
187. Blackstone, J.H., D.T. Phillips, and G.L. Hogg (1982). A state-of-the-art survey of dispatching rules for job shop operations, International Journal of Production Research 20, 27-45.
188. Blazewicz, J., W. Domschke, and E. Pesch (1996). The job shop scheduling problem: conventional and new solution techniques, European Journal of Operational Research 93, 1-33.
189. Carlier, J. (1982). The one machine sequencing problem, European Journal of Operational Research 11, 42-47.
190. Carlier, J. and E. Pinson (1989). An algorithm for solving the job-shop problem, Management Science 35, 164-176.
191. Carlier, J. and E. Pinson (1994). Adjustment of heads and tails for the job-shop problem, European Journal of Operational Research 87, 146-161.
192. Conway, R.W., W.L. Maxwell, and L.W. Miller (1967). Theory of Scheduling, Addison-Wesley, Reading, MA.
193. Dauzere-Peres, S. and J. Lasserre (1993). Amodified shifting bottleneck procedure for job-shop scheduling, International Journal of Production Research 31, 923-932.
194. Giffler B. and G.L. Thompson (1960). Algorithms for solving production scheduling problems, Operations Research 8, 487-503.
195. Golenko-Ginzburg,D., S.Kesler, and Z. Landsman (1995). Industrial job-shop schedulingwith random operations and different priorities, International Journal of Production Economics 40, 185-195.
196. Laslo, Z., D. Golenko-Ginzburg, and B. Keren (2007). Optimal booking of machines in a virtual job shop with stochastic processing times to minimize total machine rental and job tardiness costs, International Journal of Production Economics 111 (2), 812-821.
197. Nowicki, E. and C. Smutnicki (1996). A fast taboo search algorithm for the job shop problem, Management Science 42, 797-813.
198. Nowicki, E. and C. Smutnicki (2005). An advanced tabu search algorithm for the job shop problem, Journal of Scheduling 8, 145-159.
199. Panwalkar, S.S. and W. Iskander (1977). A survey of scheduling rules, Operations Research 25, 45-61.
200. Vaessens, R.J.M., E.H.L. Aarts, and J.K. Lenstra (1996). Job shop scheduling by local search, INFORMS Journal on Computing 8 (3), 302-317.
201. VanLaarhoven, P.J.M.,E.H.L.Aarts, and J.K. Lenstra (1992). Job shop scheduling by simulated annealing, Operations Research 40, 113-126.
202. 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.
203. Baker, K.R. (1968). Priority dispatching in the single channel queue with sequence-dependent setups, Journal of Industrial Engineering 19, 203-206.
204. Baker, K.R. (1984). Sequencing rules and due date assignments in a job shop, Management Science 30, 1093-1104.
205. Baker, K.R. and J.W.M. Bertrand (1981). An investigation of due date assignment rules with constrained tightness, Journal of Operations Management 1, 109-120.
206. Baker, K.R. and J.J. Kanet (1983). Job shop scheduling with modified due dates, Journal of Operations Management 4, 11-22.
207. Berry, W.L. and V. Rao (1975). Critical ratio scheduling: experimental analysis, Management Science 22, 192-201.
208. Bertrand, J.W.M. (1983). The effect ofworkload dependent due-dates on job shop performance, Management Science 29, 799-816.
209. Blackstone, J.H., D.T. Phillips, and G.L. Hogg (1982). A state-of-the-art survey of dispatching rules for job shop operations, International Journal of Production Research 20, 27-45.
210. Carroll, D.C. (1965). Heuristic sequencing of single and multiple component jobs. PhD dissertation, MIT.
211. Conway, R.W. (1965a). Priority dispatching and work-in-process inventory in a job shop, Journal of Industrial Engineering 16, 123-130.
212. Conway, R.W. (1965b). Priority dispatching and job lateness in a job shop, Journal of Industrial Engineering 16, 228-237.
213. Conway, R.W., W.L. Maxwell, and L.W. Miller (1967). Theory of Scheduling, Addison-Wesley, Reading, MA.
214. Eilon, S. and I.G. Chowdhury (1976). Due dates in job shop scheduling, International Journal of Production Research 14, 223-237.
215. Elvers, D.A. (1973). Job shop dispatching using various due date setting criteria, Production and Inventory Management 14, 62-69.
216. Elvers, D.A. and L. Taube (1983). Time completion for various dispatching rules in a job shop, Omega 11, 81-89.
217. Fry, T.D., P.R. Philipoom, and R.E. Markland (1989). Due date assignment in a multistage job shop, IIE Transactions, 21, 153-161.
218. Gere, W.S. (1966). Heuristics in job shop scheduling, Management Science 13, 167-190.
219. Kanet, J.J. (1981). A critical look at critical ratio, In Proceedings of the APICS 24th Annual Conference, pp. 182-183.
220. Kanet, J.J. and J.C. Hayya (1982). Priority dispatching with operation due-dates in a job shop, Journal of Operations Management 2, 155-163.
221. Miyazaki, S. (1981). Combined scheduling system for reducing job tardiness in a job shop, International Journal of Production Research 19, 201-211.
222. Muhlemann, A.P., A.G. Lockett, and C.I. Farn (1982). Job shop scheduling heuristics and frequency of scheduling. International Journal of Production Research 20, 227-241.
223. Pai, A.R. and K.L. McRoberts (1971). Simulation research in interchangeable part manufacturing, Management Science 17, B732-B743.
224. Panwalkar, S.S. and W. Iskander (1977). A survey of scheduling rules, Operations Research 25, 45-61.
225. Vig, M.M. and K.J. Dooley (1991). Dynamic rules for due-date assignment, International Journal of Production Research 29, 1361-1377.
226. Weeks, J.K. (1979). A simulation study of predictable due dates, Management Science 25, 363-373.
227. Clark, C.E. (1961). The greatest of a finite set of random variables, Operations Research 9, 145-162.
228. Clark, C.E. (1962). The PERT model for the distribution of an activity time, Operations Research 10, 405-406.
229. Elmaghraby, S.E. (1977). Activity Networks: Project Planning and Control byNetwork Models, Wiley, Hoboken, NJ.
230. Fulkerson, D.R. (1961). A network flow computation for project cost curves, Management Science 7 (2), 167-178.
231. Kelley, J.E. (1961). Critical-path planning and scheduling: mathematical basis, Operations Research 9 (3), 296-320.
232. Levy, F.K. and J.D. Wiest (1969). A Management Guide to PERT/CPM, Prentice Hall, Englewood Cliffs, NJ.
233. MacCrimmon, K.R. and C.A. Ryavec (1964). An analytical study of the PERT assumptions, Operations Research 12 (1), 16-37.
234. Malcolm, D.G., J.H. Rosebloom, C.E. Clark, and W. Fazar (1959). Application of a technique for a research and development program evaluation, Operations Research 7, 646-669.
235. Tversky, A. and D. Kahneman (1974). Judgment under uncertainty: heuristics and biases, Science 185, 1124-1131.
236. Van Slyke, R.M. (1963). Monte Carlo methods and the PERT problem, Operations Research 11 (5), 839-860.
237. Woolsey, R.E. (1992). The fifth column: the PERT that never was or data collection as an optimizer, Interfaces 22 (3), 112-114.
238. Davis, E.W. and J.H. Patterson (1975). A comparison of heuristic and optimum solutions in resource constrained project scheduling, Management Science 21, 944-955.
239. Demeulemeester, E. andW. Herroelen (1992). A branch and bound procedure for the multiple resource-constrained project scheduling problem, Management Science 38, 1803-1818.
240. Demeulemeester, E. and W. Herroelen (2002). Project Scheduling: A Research Handbook, Kluwer Academic Publishers, Norwell, MA.
241. Fleszar, K. and K. Hindi (2004). Solving the resource-constrained project scheduling problem by a variable neighbourhood search, European Journal of Operational Research 155, 402-413.
242. Herroelen, W. (2005). Project scheduling-theory and practice, Production and Operations Management 14 (4), 413-432.
243. Kelley, J.E. (1963). The critical path method: resources planning and scheduling, Chapter 21 in Industrial Scheduling (J. Muth and G.L. Thompson, eds.), Prentice Hall, Englewood Cliffs, NJ, pp. 347-365.
244. Kolisch, R. and S. Hartmann (2006). Experimental investigation of heuristics for resourceconstrained project scheduling: an update, European Journal of Operational Research 174, 23-37.
245. Morton, T.E. and D.W. Pentico (1993). Heuristic Scheduling Systems, Wiley, Hoboken, NJ.
246. Pritsker, A.A.B., L.J. Watters, and P.M. Wolfe (1969). Multi project scheduling with limited resources: a zero-one programming approach, Management Science 16, 93-108.
247. Schrage, L.E. (1970). Solving resource constrained network problems by implicit enumeration-nonpreemptive case, Operations Research 18, 263-278.
248. Wiest, J.D. (1964). Some properties of schedules for large projects with limited resources, Operations Research 12, 395-418.
249. Wiest, J.D. (1967). A heuristic model for scheduling large projects with limited resources, Management Science 13, B359-B377.
250. Britney, R.R. (1976). Bayesian point estimation and the PERT scheduling of stochastic activities, Management Science 22 (9), 938-948.
251. Elmaghraby, S.E., A.A. Ferreira, and L.V. Tavares (2000). Optimal start times under stochastic activity durations, International Journal of Production Economics 64, 153-164.
252. Herroelen, W. and R. Leus (2004). Robust and reactive project scheduling: a review and classification of procedures, International Journal of Production Research 42 (8), 1599-1620.
253. Herroelen, W., R. Leus, and E. Demeulemeester (2002). Critical chain project scheduling: do not oversimplify, Project Management Journal 33 (4), 48-60.
254. Kumar, A. (1989). Component inventory costs in an assembly problem with uncertain supplier lead-times, IIE Transactions 21 (2), 112-121.
255. Ronen, B. and D. Trietsch (1988). A decision support system for planning large projects, Operations Research 36, 882-890.
256. Trietsch, D. (1993). Scheduling flights at hub airports, Transportation Research Series B (Methodology) 27B (2), 133-150.
257. Trietsch, D. (2005). Why a critical path by any other name would smell less sweet: towards a holistic approach to PERT/CPM, Project Management Journal 36 (1): 27-36.
258. Trietsch, D. (2005). The effect of systemic errors on optimal project buffers, International Journal of Project Management 23, 267-274.
259. Trietsch, D. (2006). Optimal feeding buffers for projects or batch supply chains by an exact generalization of the newsvendor model, International Journal of Production Research 44, 627-637.
260. Van Slyke, R.M. (1963). Monte Carlo methods and the PERT problem, Operations Research 11 (5), 839-860.
261. Wollmer, R.D. (1985). Critical path planning under uncertainty, Mathematical Programming Study 25, 164-171.
262. Buzacott, J.A. and J.G. Shantikumar (1993). Stochastic Models of Manufacturing Systems, Prentice Hall, Englewood Cliffs, NJ.
263. Esary, J.D., F. Proschan, and D.W. Walkup (1967). Association of random variables, with applications, Annals of Mathematical Statistics 38, 1466-1474.
264. McKay, K.N., F.R. Safayeni, and J.A. Buzacott (1988). Job-shop scheduling theory: what is relevant, Interfaces 18, 84-90.
265. Ross, S.M. (1996). Stochastic Processes, 2nd ed., Wiley, Hoboken, NJ.
266. Trietsch, D. (2005). The effect of systemic errors on optimal project buffers, International Journal of Project Management 23, 267-274.
267. Lau, H.-S. (1997). Simple formulas for the expected costs in the newsboy problem: an educational note, European Journal of Operational Research 100, 557-561.
268. Blazewicz, J., M. Dror, and J. Weglarz (1991). Mathematical programming formulations for machine scheduling: a survey, European Journal of Operational Research 51, 283-300.
269. Bowman, E.H. (1959). The schedule-sequencing problem, Operations Research 7, 621-624.
270. Giglio, R.J. andWagner, H.M. (1964). Approximate solutions to the three-machine scheduling problem, Operations Research 12, 305-324.
271. Manne, A.S. (1960). On the job shop scheduling problem, Operations Research 8, 219-223.
272. Pritsker, A.A.B., L.J. Watters, and P.M.Wolfe (1969). Multi-project scheduling with limited resources: a zero-one programming approach, Management Science 16, 93-108.
273. Tseng, F.T., E.F. Stafford Jr., and J.N.D. Gupta (2004). An empirical analysis of integer programming formulations for the permutation flowshop, Omega 32, 285-293.
274. Wagner, H.M. (1959). An integer linear programming model for machine scheduling, Naval Research Logistics Quarterly 6, 131-140.