Current trends in deterministic scheduling

Annals of Operations Research

Volumn 70, Issue , 1997, Pages 1-41

  Lee, Chung Yee ^a   Lei, Lei ^b   Pinedo, Michael ^c  

^a Texas A M University   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c Department of Applied Physics and Applied Mathematics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031492360     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018909801944     Document Type: Article

References (212)

1. E.H.L. Aarts, P.J.M. van Laarhoven and J.K. Lenstra, Job shop scheduling by local search, INFORMS Journal of Computing 8(1996)302-317.
2. E.H.L. Aarts, P.J.M. van Laarhoven, J.K. Lenstra and N.L.J. Ulder, A computational study of local search algorithms for job shop scheduling, ORSA Journal of Computing 6(1994)118-125.
3. J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science 34(1988)391-401.
4. B. Adenso-Dias, Restricted neighbourhood in the tabu-search for the flow shop problem, European Journal of Operational Research 62(1992)27-37.
5. I. Adiri, J. Bruno, E. Frostig and A.H.G. Rinnooy Kan, Single machine flow-time scheduling with a single breakdown, Acta Informatica 26(1989)679-696.
6. A. Agnetis, D. Pacciarelli and F. Rossi, Batch scheduling in two-machine cell with swapping devices, Working Paper No. 28.94, Department of Informatica e Sistemistica, University of Rome, 1994.
7. M.S. Akturk and H. Yilmaz, Scheduling of AGVs in a decision making hierarchy, International Journal of Production Research 34(1996)577-591.
8. B. Alidaee and A. Ahmadian, Scheduling on a single processor with variable speed, Information Processing Letters (1997), to appear.
9. B. Alidaee and G.A. Kochenberger, A framework for machine scheduling problems with controllable processing times, Journal of Production and Operations Management (1997), to appear.
10. G. Amiri and S.F. Smith, A comparative analysis of constraint based scheduling strategies, Technical Report, The Robotics Institute, Carnegie Mellon University, 1992.
11. E.J. Anderson, C.A. Glass and C.N. Potts, Local search in combinatorial optimization: Applications in machine scheduling, Preprint Series No. OR56, Faculty of Mathematical Studies, University of Southampton, Southampton, England, 1995.
12. I. Arizono, A. Yamamoto and H. Ohta, Scheduling for minimizing total actual flow time by neural networks, International Journal of Production Research 30(1992)503-511.
13. R. Armstrong, S. Gu, and L. Lei, Minimizing the cycle time of a just-in-time manufacturing process with a single transporter, Manufacturing Research and Technology 12(1991)237-246.
14. R. Armstrong, S. Gu, and L. Lei, A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints, European Journal of Operational Research 75(1994)130-140.
15. R. Armstrong, S. Gu and L. Lei, Greedy algorithm to determine the number of transporters in a cyclic electroplating process, HE Transactions 27(1995)1-9.
16. R. Armstrong, S. Gu and L. Lei, An efficient algorithm for a class of two-resource allocation problems, ORSA Journal on Computing (1997), to appear.
17. R. Armstrong, S. Gu and L. Lei, Solving a class of two-resource allocation problems by equivalent load method, Journal of the Operational Research Society (1997), to appear.
18. H. Aytug, S. Bhattacharyya, G.J. Koehler and J.L. Snowdon, A review of machine learning in scheduling, IEEE Transactions on Engineering Management 41(1994)165-171.
19. K.R. Baker, Elements of Sequencing and Scheduling, Amos Tuck School, Dartmouth College, Hanover, NH, 1995.
20. K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Operations Research 38(1990)22-36.
21. J.W. Barnes and M. Laguna, Solving the multiple machine weighted flow time problem using tabusearch, IIE Transactions 25(1993)121-128.
22. J.W. Barnes and M. Laguna, A tabu search experience in production scheduling, Annals of Operations Research 41(1993)141-156.
23. J.W. Barnes, M. Laguna and F. Glover, An overview of tabu-search approaches to production scheduling problems, in: Intelligent Scheduling Systems, Brown and Scherer, eds., Kluwer Academic, 1995, pp. 101-128.
24. J. Bartholdi, III and L. Platzman, Decentralized control of automated guided vehicles on a simple loop, IIE Transactions 21(1989)76-81.
25. J. Bean, Genetics and random keys for sequencing and optimization, ORSA Journal of Computing 6 (1994)154-160.
26. L. Bianco, J. Blazewicz, P. Dell'Olmo and M. Drozdowski, Preemptive multiprocessor task scheduling with release times and time windows, Annals of Operations Research (1997), this volume.
27. L. Bianco, J. Blazewicz, P. Dell'Olmo and M. Drozdowski, Preemptive scheduling of multiprocessor tasks on the dedicated processors system subject to minimal lateness, Information Processing Letters 46(1993)109-113.
28. L. Bianco, J. Blazewicz, P. Dell'Olmo and M. Drozdowski, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Annals of Operations Research 58(1995)493-517.
29. C. Bierwirth, A generalized permutation approach to job shop scheduling with genetic algorithms, OR Spektrum 17(1995)87-92.
30. U. Bilge and G. Ulusoy, A time window approach to simultaneous scheduling of machines and material handling system in an FMS, Operations Research 43(1995)1058-1070.
31. E.L. Blair, P. Charnsethikul and A. Vasques, Optimal routing of driverless vehicles in a flexible material handling system, Material Flow 4(1987)73-83.
32. J. Blazewicz, R. Burkard, G. Finke and G. Woeginger, Vehicle scheduling in two cycle flexible manufacturing systems, Mathematics and Computer Modeling 20(1994)19-31.
33. J. Blazewicz, P. Dell'olmo, M. Drozdowski and M.G. Speranza, Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters 41(1992)275-280.
34. J. Blazewicz, M. Drabowski and J. Weglarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers C-35(1986)389-393.
35. J. Blazewicz, M. Drozdowski, G. Schmidt and D. de Werra, Scheduling independent two-processor tasks on a uniform duo-processor system, Discrete Applied Mathemaatics 28(1990)11-20.
36. J. Blazewicz, M. Drozdowski, G. Schmidt and D. de Werra, Scheduling independent multiprocessor tasks on a uniform k-processor system, Parallel Computing 20(1994)15-28.
37. J. Blazewicz, M. Drozdowski and J. Weglarz, Scheduling multiprocessor tasks - a survey, International Journal of Microcomputer Applications 13(1994)89-97.
38. J. Blazewicz, K. Ecker, G. Schmidt and J. Weglarz, Scheduling in Computer and Manufacturing Systems, 2nd ed., Springer, New York, 1994.
39. J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer, Berlin/New York, 1996.
40. J. Blazewicz, H.A. Eiselt, G. Finke, G. Laporte and J. Weglarz, Scheduling tasks and vehicles in a flexible manufacturing system, The International Journal of Flexible Manufacturing Systems 4(1991)5-16.
41. J. Blazewicz, J. Weglarz and W. Drabowski, Scheduling independent 2-processor tasks to minimize scheduling length, Information Processing Letters 18(1984)267-273.
42. Y.A. Bozer and M.M. Srinivasan, Tandem configurations for automated guided vehicle systems and the analysis of single vehicle loops, HE Transactions 23(1991)72-82.
43. D.E. Brown and W.T. Scherer (eds.), Intelligent Scheduling Systems, Kluwer Academic, Boston, MA, 1995.
44. P. Brucker, J. Hurnik and F. Werner, Improving local search heuristics for some scheduling problems: Part I, Discrete Applied Mathematics (1996), to appear.
45. P. Brucker, J. Hurnik and F. Werner, Improving local search heuristics for some scheduling problems: Part II, Discrete Applied Mathematics (1996), to appear.
46. P. Brucker, Scheduling Algorithms, Springer, New York, 1995.
47. P. Brucker and A. Krämer, Shop scheduling problems with multiprocessor tasks on dedicated processors, Annals of Operations Research 57(1995)13-27.
48. P. Brucker and A. Krämer, Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems, European Journal of Operational Research 90(1996)214-226.
49. X. Cai, C.-Y. Lee and C.L. Li, Scheduling multiprocessor tasks with prespecified processor allocations, (1996), submitted.
50. S.H. Chang and P.J. Egbelu, Dynamic relative positioning of AGVs in a loop layout to minimize the mean system response time, Working Paper, Department of Industrial and Manufacturing Engineering, Pennsylvania State University, 1995.
51. H. Chen, C. Chu and J.M. Proth, Cyclic hoist scheduling based on graph theory, in: INRIA/IEEE Symposium on Emerging Tech. and Factory Automation, 1995, pp. 451-459.
52. C.-C. Cheng and S.F. Smith, Applying constraint satisfaction techniques to job shop scheduling, Annals of Operations Research (1997), this volume.
53. T.C.E. Cheng, A simulation study of automated guided vehicle dispatching, Robotics and Computer-Integrated Manufacturing 3(1987)335-338.
54. H.K. Chu, P.J. Egbelu and C. Wu, Advisor: A computer-aided material handling equipment selection system, International Journal of Production Research 33(1995)3311-3329.
55. C. Chu and J.M. Proth, Single machine scheduling with chain structured precedence constraints and separation time windows, IEEE Trans, on Robotics and Automation (1996), to appear.
56. Y. Chung and G.W. Fisher, A neural algorithm for finding the shortest flow path for an automated guided vehicle system, IIE Transactions 27(1995)773-783.
57. C.G. Co and J.M.A. Tanchoco, A review of research on AGV vehicle management, Engineering Costs and Production Economics 21(1991)35-42.
58. Y. Crama, Combinatorial optimzation models for production scheduling in automated manufacturing systems, EURO 20th Anniversary Volume, 1996, to appear.
59. Y. Crama and J. Klundert, Cyclic scheduling of identical parts in a robotic cell, Operations Research (1996), to appear.
60. H.A.J. Crauwels, C.N. Potts and L.N. van Wassenhove, Local search heuristics for single machine scheduling with batching to minimize total weighted completion time, Annals of Operations Research (1997), this volume.
61. R.L. Daniels, B.J. Hoopes and J.B. Mazzola, Scheduling parallel manufacturing cells with resource flexibility, Management Science 42(1996)1260-1276.
62. R.L. Daniels, B.J. Hoopes and J.B. Mazzola, An analysis of heuristics for the parallel machine flexible-resource scheduling problem, Annals of Operations Research (1997), this volume.
63. R.L. Daniels and J.B. Mazzola, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, Annals of Operations Research 41(1993)207-230.
64. R.L. Daniels and J.B. Mazzola, Flow shop scheduling with resource flexibility, Operations Research 42(1994)504-522.
65. S. Dauzère-Pérès and J. Paulli, A global tabu search procedure for the general multi-processor job-shop scheduling problem, Annals of Operations Research (1997), this volume.
66. F. Della Croce, R. Tadei and G. Volta, A genetic algorithm for the job shop problem, Computers and Operations Research 22(1995)15-24.
67. M. Dell'Amico and M. Trubian, Applying tabu-search to the job shop scheduling problem, Annals of Operations Research 41(191993)231-252.
68. M. Desrochers and F. Soumis, A generalized permanent labelling algorithm for the shortest path with time windows, INFOR 26(1988)193-214.
69. G. Dobson and U. Karmarkar, Simultaneous resource scheduling to minimize weighted flow times, Operations Research 37(1989)592-600.
70. G. Dobson and I. Khosla, Simultaneous resource scheduling with batching to minimize weighted flow times, IIE Transactions 27(1995)587-598.
71. U. Dorndorf and E. Pesch, Evolution based learning in a job shop scheduling environment, Computers and Operations Research 22(1995)25-40.
72. Z. Du and J.Y.-T. Leung, Complexity of scheduling parallel task systems, SIAM J. Discr. Math. 2(1989) 473-487.
73. P.J. Egbelu and J.M.A. Tanchoco, Characterization of automated guided vehicle dispatching rules, International Journal of Production Research 22(1984)359-374.
74. P.J. Egbelu, Pull versus push strategy for automated guided vehicle load movement in a batch manufacturing system, Journal of Manufacturing Systems 6(1987)271-180.
75. P.J. Egbelu and N. Roy, Material flow control in AGV/unit load based production lines, International Journal of Production Research 26(1988)81-94.
76. P.J. Egbelu, Positioning of automated guided vehicles in a loop layout to improve response time, European Journal of Operational Research 71(1993)32-44.
77. T. Ganesharajah, N. Hall and C. Sriskandarajah, Design and operational issues in AGV-served manufacturing systems, Working Paper, University of Toronto, 1995.
78. T. Ganesharajah, N. Hall and C. Sriskandarajah, AGV-served manufacturing systems: Scheduling and design in loop layouts, Working Paper, University of Toronto, 1996.
79. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, 1979.
80. P.C. Gilmore and R.E. Gomory, Sequencing a one-variable machine: A solvable case of the traveling salesman problem, Operations Research 12(1964)655-679.
81. C.A. Glass, C.N. Potts and P. Shade, Unrelated parallel machine scheduling using local search, Mathematical and Computer Modelling 20(1994)41-52.
82. F. Glover, Tabu-search, Part I, ORSA Journal of Computing 1(1989)190-206.
83. F. Glover, Tabu-search, Part II, ORSA Journal of Computing 2(1990)4-32.
84. F. Glover, Tabu thresholding: Improved search by nonmonotonic trajectories, ORSA Journal of Computing 7(1995)426-442.
85. F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Annals of Operations Research 41(1993)3-28.
86. S.C. Graves, A review on production scheduling, Operations Research 29(1981)646-676.
87. C. Gupta, Y.P. Gupta and A. Kumar, Minimizing flow time variance in a single machine using genetic algorithms, European Journal of Operational Research 70(1993) 289-303.
88. N.G. Hall, H. Kamoun and C. Sriskandarajah, Scheduling robotic cells: Large cells, Working Paper, The Ohio State University, 1993.
89. N.G. Hall, H. Kamoun and C. Sriskandarajah, Scheduling in robotic cells: Classification, two machine cells, identical parts, Operations Research (1996a), to appear.
90. N.G. Hall, H. Kamoun and C. Sriskandarajah, Scheduling in robotic cells: Heuristics and cell design, (revised for) Operations Research (1996b).
91. N.G. Hall, H.K. Kamoun and H. Wan, Scheduling large robotic cells, Working Paper, College of Business, The Ohio State University, 1994.
92. N.G. Hall, M.E. Posner and C.N. Potts, Scheduling with finite output buffers, (revised for) Operations Research (1993).
93. N.G. Hall, M.E. Posner and C.N. Potts, Scheduling with finite capacity input buffers, (revised for) Operations Research (1994).
94. N.G. Hall, M.E. Posner and C.N. Potts, Preemptive scheduling with finite capacity input buffers, Annals of Operations Research (1997), this volume.
95. N.G. Hall, C. Potts and C. Sriskandarajah, Parallel machine scheduling with a common server, Working Paper, College of Business, The Ohio State University, 1994.
96. N.G. Hall and C. Sriskandarajah, A survey of machine sceduling problems with blocking and no-wait in process, Operations Research 44(1996)510-525.
97. J.W. Herrmann, C.-Y. Lee and J. Hinchman, Global job shop scheduling with a genetic algorithm, Production and Operations Management 4(1995)30-45.
98. J. Herrmann, C.-Y. Lee and J. Snowdon, A classification of static scheduling problems, in: Complexity in Numerical Optimization, P.M. Pardalos, ed., World Scientific, 1993, pp. 203-253.
99. A. Hertz, Y. Mottet and Y. Rochat, On a scheduling problem in a robotized analytical system, Working Paper No. ORWP 92/17, Ecole Polytechnique Fédérale, Lausanne, 1993.
100. T.J. Hodgson, R.E. King, S.K. Monteith and S.R. Shultz, Developing control rules for an AGVS using Markov decision processes, Material Flow 4(1987)85-96.
101. J.H. Holland, Genetic algorithms and the optimal allocation of trials, SIAM Journal on Computing 2(1973)88-105.
102. J.H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, MI, 1975.
103. J.A. Hoogeveen, S.L. van de Velde and B. Deltman, Complexity of scheduling multiprocessor tasks with prespecified allocations, Discrete Applied Mathematics 55(1994)259-272.
104. R. Hubscher and F. Glover, Applying tabu-search with influential diversification to multiprocessor scheduling, Computers and Operations Research 21(1994)877-884.
105. J. Hurink, B. Jurisch and M. Thole, Tabu search for the job shop scheduling problem with multi-purpose machines, OR Spektrum 15(1994)205-215.
106. R. Jaikumar and M.M. Solomon, Dynamic scheduling of automated guided vehicles for a certain class of systems, Journal of Manufacturing Systems 9(1992)315-323.
107. W. Jeng, J. Lin and U. Wen, Algorithms for sequencing robot activities in a robot-centered parallel-processor workcell, Computers and Operations Research 20(1993)185-197.
108. M. Kaspi and B. Montreuil, On the scheduling of identical parallel processes with arbitrary initial processor available times, Research Report 88-12, School of Industrial Engineering, Purdue University, 1988.
109. C.W. Kim and J.M.A. Tanchoco, Conflict-free shortest-time bidirectional AGV routing, International Journal of Production Research 29(1991)2377-2391.
110. R.E. King, T.J. Hodgson and F.W. Chafee, Robot task scheduling in a flexible manufacturing cell, HE Transactions 25(1993)80-87.
111. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983) 671-680.
112. H. Kise, T. Shioyama and T. Ibaraki, Automated two machine flowshop scheduling: A solvable case, IIE Transactions 23(1991)10-16.
113. C.M. Klein and J. Kim, AGV dispatching, International Journal of Production Research 34(1996) 95-110.
114. A. Krämer, Scheduling multiprocessor tasks on dedicated processors, Ph.D. Thesis, FB Mathematik/ Informatik, Universität Osnabrück, 1995.
115. H. Krawczyk and M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Transactions on Computers 34(1985)869-872.
116. N. Krishnamurthy, R. Batta and M. Karwan, Developing conflict-free routes for automated guided vehicles, Operations Research 41(1993)1077-1090.
117. M. Kubale, The complexity of scheduling independent two-processor tasks on dedicated processors, Information Processing Letters 24(1987)141-147.
118. A. Kusiak and P. Cyrus, Routing and scheduling of automated guided vehicles, in: Proceedings of the 8th International Conference on Production Research, 1985, pp. 247-251.
119. A. Kusiak, Scheduling automated manufacturing systems: Knowledge-based approach, in: Proceedings of the 3rd ORSA/TIMS Conference on Flexible Manufacturing Systems: Operations Research Models and Applications, K.E. Stecke and R. Suri, eds., 1989, pp. 377-382.
120. M. Laguna, J.W. Barnes and F. Glover, Tabu search methods for a single machine scheduling problem, Journal of Intelligent Manufacturing 2(1991)63-74.
121. M. Laguna, J.W. Barnes and F. Glover, Intelligent scheduling with tabu-search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times, Journal of Applied Intelligence 3(1993)159-172.
122. M. Laguna and F. Glover, Integrating target analysis and tabu-search for improved scheduling systems, Expert Systems with Applications 6(1993)287-297.
123. M. Laguna and J.L. Gonzalez Velarde, A search heuristic for Just-In-Time scheduling in parallel machines, Journal of Intelligent Manufacturing 2(1991)253-260.
124. A. Langevin, D. Lauzon and D. Riopel, Dispatching, routing and scheduling of two automated guided vehicles in a flexible manufacturing system, GERAD Working Paper, Ecole Polytechnique de Montréal, 1994.
125. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Handbook in Operations Research and Management Science, S.S. Graves, A.H.G. Rinnooy Kan and P. Zipkin, eds., Vol. 4, North-Holland, New York, 1993, pp. 445-522.
126. G. Lawton, Genetic algorithms for schedule optimization, AI Expert (May 1992)23-27.
127. C.-Y. Lee, Parallel machines scheduling with non-simultaneous machine available time, Discrete Applied Mathematics 30(1991)53-61.
128. C.-Y. Lee, Machine scheduling with an availability constraint, Journal of Global Optimization, special issue on Optimization on Scheduling Application, 9(1996a)395-416.
129. C.-Y. Lee, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Operations Research Letters (1996b), to appear.
130. C.-Y. Lee and X. Cai, Scheduling multiprocessor tasks without prespecified processor allocations, 1996, submitted.
131. C.-Y. Lee and S.D. Liman, Single machine flow-time scheduling with scheduled maintenance, Acta Informatica 29(1992)375-382.
132. C.-Y. Lee and S.D. Liman, Capacitated two-parallel machines scheduling to minimize sum of job completion times, Discrete Applied Mathematics 41(1993)211-222.
133. C.-Y. Lee, S. Piramuthu and Y.K. Tsai, Job shop scheduling with a genetic algorithm and machine learning, Int. J. Production Research (1995), to appear.
134. C.-Y. Lee and G. Vairaktarakis, Complexity of single machine hierarchy scheduling: A survey, in: Complexity in Numerical Optimization, P.M. Pardalos, ed., World Scientific, New Jersey, 1993, pp. 269-298.
135. Y.H. Lee, K. Bhaskanan and M. Pinedo, A heuristic to minimize total weighted tardiness with sequence dependent setups, IIE Scheduling and Logistics (1997), to appear.
136. 2 log N log B) algorithm for determining the optimal integer cyclic transportation schedule with a given route, Computers and Operations Research 20(1993a)807-816.
137. L. Lei, Adaptive control of feasible cycle times in a processing line with multiple transporters, in: Proceedings of the International Conference on Pacific Region Management, 1993b, pp. 123-131.
138. L. Lei, R. Armstrong and S. Gu, Minimizing the fleet size for a cyclic transportation schedule with dependent time windows and single-track constraints, Operations Research Letters 14(1993)91-98.
139. L. Lei, R. Armstrong and S. Gu, Determining the number of transporters for a cyclic transportation schedule, Applications of Management Science: Engineering 9(1996), to appear.
140. L. Lei and T.J. Wang, A proof on the NP-completeness of the hoist scheduling problems, Working Paper No. 89-06, Graduate School of Management, Rutgers University, 1989.
141. L. Lei and T.J. Wang, The minimum common-cycle algorithm for cyclic scheduling of two hoists with time window constraints, Management Science 37(1991)1629-1639.
142. L. Lei and T.J. Wang, On the optimal cyclic schedules of single hoist electroplating processes, IIE Transactions 26(2)(1994)25-33.
143. V.J. Leon and R. Balakrishnan, Strength and adaptibility of problem-space based neighbourhoods for resource constrained scheduling, OR Spektrum 17(1995)173-182.
144. E. Levner and V. Kats, A polynomial algorithm for a cyclic robotic flowshop problem, (revised for) European Journal of Operational Research (1996).
145. E. Levner and A.S. Ptuskin, The construction of cyclic schedules for fuzzy durations of operations, Engineering Cybernetics: Soviet J. of Computer and Systems Science 3(1989)10-14.
146. C.-L. Li, X. Cai and C.-Y. Lee, Machine scheduling with multiple-job-on-one-machine pattern (1996), submitted.
147. S. Liman, Scheduling with capacities and due-dates, Ph.D. Dissertation, Industrial and Systems Engineering Department, University of Florida, 1991.
148. B. Mahadevan and T.T. Narendren, Design of automated guided vehicle-based material handling system for a flexible manufacturing system, International Journal of Production Research 29(1990) 1611-1622.
149. M. Manier, C. Varnier and P. Baptiste, A constraint logic programming approach to a cyclic multi-hoists scheduling problem, in: Proceedings of the 4th International Conference of Project Management and Scheduling, 1994.
150. H. Matsuo, J. Shang and R.S. Sullivan, A crane scheduling problem in a computer-integrated manufacturing environment, Management Science 37(1991)587-606.
151. H. Matsuo, C.J. Suh and R.S. Sullivan, A controlled search simulated annealing method for the single machine weighted tardiness problem, Working Paper 87-12-2, Department of Management, University of Texas at Austin, TX, 1987.
152. H. Matsuo, C.J. Suh and R.S. Sullivan, A controlled search simulated annealing method for the general job shop scheduling problem, Working Paper 03-44-88, Department of Management, University of Texas at Austin, TX, 1988.
153. E. Mayrand, P. Lefrancois, O. Kettani and M.-H. Jobin, A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility, OR Spektrum 17(1995)183-192.
154. V.S. Mikhalevich, S.A. Beletsky and A.P. Monastyrev, Optimization of multi-stage cyclic service of a production line by a transmanipulator, Cybernetics 24(1988/1989)500-511.
155. J. Mittenthal, M. Raghavachari and A.I. Rana, A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions, Computers and Operations Research 20 (1993)103-111.
156. T.E. Morton and D.W. Pentico, Heuristic Scheduling Systems, Wiley, New York, 1993.
157. T.E. Morton and P. Ramnath, Guide forward search in tardiness scheduling of large one machine problems, in: Intelligent Scheduling Systems, Brown and Scherer, eds., Kluwer Academic, 1995.
158. G. Mosheiov, Minimizing the sum of job completion times on capacitated parallel machines, Math. Comput. Modelling 20(1994)91-99.
159. W.C. Ng, A branch and bound algorithm for hoist scheduling of a circuit board production line, The International Journal of Flexible Manufacturing Systems 8(1996)45-65.
160. S.J. Noronha and V.V.S. Sarma, Knowledge-based approaches for scheduling problems: A survey, IEEE Transactions on Knowledge and Data Engineering 3(1991)160-171.
161. E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem, Preprint 8/93, Instytut Cybernetyki Technicznej, Politechniki Wroclawskiej, Wroclaw, 1993.
162. E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the flow shop problem, Preprint 8/94, Instytut Cybernetyki Technicznej, Politechniki Wroclawskiej, Wroclaw, 1994.
163. W.M. Nowijn, W. Kern and S. Bass, Scheduling jobs with release times on a machine with finite storage, European Journal of Operational Research 74(1994)120-127.
164. F.A. Ogbu and D.K. Smith, The application of the simulated annealing algorithm to the solution of the flow shop problem, Computers and Operations Research 17(1990)243-253.
165. L. Ozdamar and G. Ulusoy, A survey on the resource-constrained project scheduling problem, IIE Transactions 27(1995)574-586.
166. E. Pesch, Learning in Automated Manufacturing - A Local Search Approach, Physica-Verlag, Heidelberg, 1994.
167. L.W. Phillips and P.S. Unger, Mathematical programming solution of a hoist scheduling program, AIIE Transactions 8(1976)219-225.
168. M.L. Pinedo, Scheduling: Theory, Algorithms and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.
169. M.L. Pinedo and M. Singer, A shifting bottleneck heuristic for minimizing the total weighted tardiness in job shops, Technical Report IEOR 96-12, Columbia University, New York, 1996.
170. J. Plehn, Preemptive scheduling of independent jobs with release times and deadlines on a hypercube, Information Processing Letters C-34(1990)161-166.
171. C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity, Journal of Operational Research Society 43(1992)395-406.
172. U.S. Rao and P.L. Jackson, Subproblems in identical jobs cyclic scheduling: Properties, complexity and solution approaches, Working Paper, Cornell University, 1993.
173. C.R. Reeves, Improving the efficiency of tabu search for machine sequencing problems, Journal of the Operational Research Society 44(1993)375-382.
174. C.R. Reeves, A genetic algorithm for flow shop sequencing, Computers and Operations Research 22 (1995)5-13.
175. D. Riopel and A. Langevin, Optimizing the location of material transfer stations within layout analysis, International Journal of Production Economics 22(1991)169-176.
176. R. Russell and T.M.A. Tanchoco, An evaluation of vehicle dispatching rules and their effect on shop performance, Material Flow 1(1984)271-280.
177. I. Sabuncuoglu and D.L. Hommertzheim, An investigation of machine and AGVscheduling rules in an FMS, in: Proceedings of the 3rd ORSA/TIMS Conference on Flexible Manufacturing Systems: Operations Research Models and Applications, K.E. Stecke and R. Suri, eds., 1989, pp. 261-266.
178. I. Sabuncuoglu and D.L. Hommertzheim, Dynamic dispatching algorithm for scheduling machines and automated guided vehicles in a flexible manufacturing system, International Journal of Production Research 30(1992a)1059-1079.
179. I. Sabuncuoglu and D.L. Hommertzheim, Experimental investigation of machine and AGV scheduling rules against the mean-flow time criterion, International Journal of Production Research 30(1992b) 1617-1635.
180. S. Sahni, Approximation algorithms for the 0-1 knapsack problem, Journal of the Association for Computing Machinery 20(1975)115-124.
181. G. Schmidt, Scheduling on semi-identical processors, ZOR - Zeitschrift für Operations Research 28 (1984)153-162.
182. G. Schmidt, Scheduling independent tasks with deadlines on semi-identical processors, Journal of the Operational Research Society 39(1988)271-277.
183. S.P. Sethi, C. Sriskandarajah, G. Sorger, J. Blazewicz and W. Kubiak, Sequencing of parts and robot moves in a robotic cell, International Journal of Flexible Manufacturing Systems 4(1992)331-358.
184. G.W. Shapiro, Hoist scheduling for a PCB electroplating facility, unpublished M.S. Thesis, North Carolina University, 1985.
185. G.W. Shapiro and H.W. Nuttle, Hoist scheduling for a PCB electroplating facility, IIE Transactions 20(1988)157-167.
186. J. Shapiro, Mathematical Programming: Structures and Algorithms, Wiley, 1979.
187. J. Slomp, G.J.G. Gaalman and W.M. Nawijn, Quasi on-line scheduling procedures for flexible manufacturing systems, International Journal of Production Research 26(1988)585-598.
188. D. Sinriech and J.M.A. Tanchoco, The centroid projection method for locating pick-up and delivery stations in single-loop AGV systems, Journal of Manufacturing Systems 11(1992)297-307.
189. S.F. Smith, Knowledge-based production management: Approaches, results and prospects, Production Planning and Control 3(1992)350-380.
190. S.F. Smith, private communication, 1996.
191. S.F. Smith, N. Muscettola, D.C. Matthys, P.S. Ow and Y. Potvin, OPIS: An opportunistic factory scheduling system, in: Proceedings of the 3rd International Conference on Industrial and Expert Systems (IEA/AIE 90), Charleston, SC, 1990.
192. W. Song, Z.B. Zabinsky and R.L. Storch, An algorithm for scheduling a chemical processing tank line, Production Planning and Control 4(1993)323-332.
193. C. Sriskandarajah, N.G. Hall and H. Kamoun, Scheduling in robotic cells: Complexity and steady state analysis, Working Paper, The Ohio State University, 1994.
194. K.E. Stecke, Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems, Management Science 29(1983)273-288.
195. H.I. Stern and G. Vitner, Scheduling parts in a combined production-transportation work cell, Journal of the Operational Research Society 41(1990)625-632.
196. R.H. Storer, S.D. Wu and R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Management Science 38(1992)1495-1509.
197. R.H. Storer, S.D. Wu and R. Vaccari, Problem and heuristic space search strategies for job shop scheduling, ORSA Journal of Computing 7(1995)453-467.
198. F. Taghaboni and J.M.A. Tanchoco, A LISP-based controller for free-ranging automated guided vehicle systems, International Journal of Production Research 26(1988)173-188.
199. E. Taillard, Parallel taboo search techniques for the job shop scheduling problem, ORSA Journal of Computing 6(1994)108-117.
200. V.S. Tanaev, V.S. Gordon and Y.M. Shafransky, Scheduling Theory. Single-Stage Systems, Kluwer Academic, The Netherlands, 1994.
201. V.S. Tanaev, Y.N. Sotskov and V.A. Strusevich, Scheduling Theory. Multi-Stage Systems, Kluwer Academic, The Netherlands, 1994.
202. J.A. Tompkin and J.A. White, Facilities Planning, Wiley, New York, 1984.
203. M.A. Trick, Scheduling multiple variable-speed machines, Operations Research 42(1994)234-248.
204. D. Trietsch and K.R. Baker, Basic techniques for lot streaming, Operations Research 41(1993)1065-1076.
205. A.J. Vakharia and Y.-L. Chang, A simulated annealing approach to scheduling a manufacturing cell, Naval Research Logistics 37(1990)559-577.
206. P.J.M. Van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Operations Research 40(1992)113-125.
207. R.J.M. Vaessens, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by local search, INFORMS Journal of Computing 8(1996)302-317.
208. B. Veltmann, B.J. Lageweg and J.K. Lenstra, Multiprocessor scheduling with communication delays, Parallel Computing 16(1990)173-182.
209. Y. Yih, Trace-driven knowledge acquisition (TDKA) for rule-based real-time scheduling systems, Journal of Intelligent Manufacturing 1(1990)217-230.
210. Y. Yih and A. Thesen, Semi-Markov decision models for real-time scheduling, International Journal of Production Research 29(1991)2331-2346.
211. D. Yim and R. Linn, Push and pull rules for dispatching automated quided vehicles in a flexible manufacturing system, International Journal of Production Research 31(1993)43-57.
212. S. Webster and K.R. Baker, Scheduling groups of jobs on a single machine, Operations Research 43 (1996)693-702.