Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms

Mathematics and Computers in Simulation

Volumn 35, Issue 5, 1993, Pages 397-434

  Tzafestas, Spyros ^a   Triantafyllakis, Alekos ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; TIME AND MOTION STUDY;

DETERMINISTIC SCHEDULING; MAKESPAN MINIMIZATION; MAXIMUM LATENESS MINIMIZATION; OPTIMALITY CRITERION; PARALLEL PROCESSOR SCHEDULING;

SCHEDULING;

EID: 0027695322     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/0378-4754(93)90041-R     Document Type: Article

References (190)

1. An expert system for the selection of scheduling rules in a job shop
2. Decision models for aiding FMS scheduling and control
3. A survey of some theoretical aspects of multiprocessing
4. Optimal scheduling on two processors with different speeds
5. Scheduling with parallel processors and linear delay costs
6. Finding an optimal sequence by dynamic programming: an extension to precedence related tasks
7. The sequencing problem
8. OPAL: a multi-knowledge-based system for industrial job-shop scheduling
9. Critical ratio scheduling: an experimental analysis
10. Production planning of style goods with high setup costs and forecast revisions
11. A state-of-the-art survey of dispatching rules for manufacturing job shop operations
12. Scheduling dependent tasks with different arrival times to meet deadlines
13. Simple algorithms for multiprocessor scheduling to meet deadlines
14. Complexity of computer scheduling algorithms under resource constraints
15. Deadline scheduling of tasks with ready times and resource constraints
16. Methods Oper. Res.
17. Minimizing mean flow-time with parallel processors and resource constraints
18. Selected topics in scheduling theory
19. Scheduling tasks on two processors with deadlines and additional resources
20. A strategy for scheduling splittable tasks to reduce schedule length
21. A linear time algorithm for restricted bin packing and scheduling problems
22. Scheduling unit-time tasks on flow-shops under resource constraints
23. Scheduling independent fixed-type tasks
24. Routing and scheduling within a job shop framework
25. Scheduling subject to resource constraints classification and complexity
26. Hybrid hierarchical scheduling and control systems in manufacturing
27. Autonomous manufacturing: automating the job shop
28. Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness
29. Scheduling independent tasks to reduce mean finishing time
30. Complexity of task sequencing with deadlines set-up times and changeover costs
31. Task scheduling in systems with nonpreemptable resources
32. Efficient scheduling algorithms for robot inverse dynamics computation on a multiprocessor system
33. Preemptive scheduling of independent jobs on a hypercube
34. On a class of scheduling algorithms for multiprocessors computing systems
35. Real-time feedback scheduling of flexible manufacturing systems
36. Optimal due-date determination and sequencing of n jobs on a single machine
37. Bounds for list schedules on uniform processors
38. Preemptive scheduling of independent jobs with release and due times on open, flow and job shops
39. On packing two-dimensional bins
40. An application of bin-packing to multiprocessor scheduling
41. Optimal scheduling for two-processor systems
42. A generalized bound on LPT sequencing
43. An evaluation of flow shop sequencing heuristics
44. On scheduling with ready times to minimize mean flow time
45. On periodic scheduling of time-critical tasks
46. On a real-time scheduling problem
47. Simultaneous resource scheduling to minimize weighted flow times
48. Scheduling tree-structured tasks with restricted execution times
49. The effectiveness of supervisory control strategies in scheduling flexible manufacturing systems
50. Bounds for the optimal scheduling of n jobs on m processors
51. A branch-and-bound approach to the bicriterion scheduling problem involving total flowtime and range of lateness
52. Worst-case analysis of heuristic algorithms
53. ISIS — a knowledge-based system for factory scheduling
54. Bounds for multifit scheduling on uniform processors
55. Variable sized bin packing
56. Optimal sequencing of two equivalent processors
57. Bounds for multiprocessor scheduling with resource constraints
58. Performance guarantees for scheduling algorithms
59. Resource constrained scheduling as generalized bin packing
60. Complexity results for multiprocessor scheduling under resource constraints
61. Scheduling tasks with nonuniform deadlines on two processors
62. Two-processor scheduling with start-times and deadlines
63. Scheduling unit-time tasks with arbitrary release times and deadlines
64. Scheduling opposing forests
65. Minimal resources for fixed and variable job schedules
66. Deterministic processor scheduling
67. Optimal mean finish time preemptive schedules
68. Bounds for LPT schedules on uniform processors
69. A new algorithm for preemptive scheduling of trees
70. Open shop scheduling to minimize finish time
71. Flowshop and jobshop schedules: complexity and approximation
72. Preemptive scheduling for uniform processor systems
73. Non-preemptable scheduling of unequal execution time tasks on two identical processors
74. Bounds on multiprocessing timing anomalies
75. Optimization and approximation in deterministic sequencing and scheduling: a survey
76. Lessons for O.R. from A.I.: a scheduling case study
77. The effectiveness of three heuristic rules for job sequencing in a single production facility
78. Scheduling jobs with simple precedence constraints on parallel machines
79. Neural computation of decision in optimization problems
80. Single-machine job sequencing with treelike precedence ordering and linear delay penalties
81. Some simple scheduling algorithms
82. A level algorithm for preemptive scheduling
83. Parallel sequencing and assembly line problems
84. Some optimum algorithms for scheduling problems with changeover costs
85. On the interactive solution to a multicriteria scheduling problem
86. Heuristic algorithms for scheduling independent tasks on nonidentical processors
87. A new approach to perturbation analysis for manufacturing scheduling problems (MSP)
88. Fast algorithms for bin packing
89. Optimal two-and-three-stage production schedules
90. Expert systems in production scheduling
91. 2.5) algorithm for maximum matching in general graphs
92. Reducibility among combinatorial problems
93. Probabilistic analysis of combinatorial algorithms: an annotated bibliography
94. Parallel processing of robot-arm control computation on a multiprocessor system
95. Look-ahead scheduling for minimizing machine interference
96. Analysis of computer scheduling with memory constraints
97. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems
98. On the worst-case ratio of a compound multiprocessor scheduling algorithm
99. Aggregate scheduling of a flexible machining and assembly system
100. Manufacturing systems: a knowledge- and optimization-based approach
101. Preemptive scheduling of uniform processors subject to release dates
102. Computer aided complexity classification of deterministic scheduling problems
103. Job-shop scheduling by implicit enumeration
104. Worst case analysis of two scheduling algorithms
105. Improved LPT scheduling for identical processor systems
106. A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness
107. Sequencing jobs to minimize total weighted completion time subject to precedence constraints
108. Recent results in the theory of machine scheduling
109. Preemptive scheduling of precedence-constrained jobs on parallel machines
110. Preemptive scheduling of unrelated parallel processors by linear programming
111. Recent developments in deterministic sequencing and scheduling: a survey
112. A functional equation and its application to resource allocation and sequencing problems
113. Minimization of time-varying costs in single-machine scheduling
114. A heuristic scheduling policy for multi-item, single-machine production systems with time-varying, stochastic demands
115. Complexity of scheduling under precedence constraints
116. Complexity of machine scheduling problems
117. Bounds on scheduling algorithms for heterogeneous computing systems
118. Performance analysis of heterogeneous multiprocessor computing systems
119. The single-plant allocation problem with capacity and changeover restrictions
120. Scheduling of parallel computation for a computer-controlled mechanical manipulator
121. Schedule generation and reconfiguration for parallel machines
122. Scheduling with deadlines and loss functions
123. Stochastic scheduling problems I: general strategies
124. Linear-time algorithms for scheduling on parallel processors
125. An n job one machine sequencing algorithm for minimizing the number of late jobs
126. A user interface for a knowledge-based planning and scheduling system
127. Optimal preemptive scheduling on two-processor systems
128. Preemptive scheduling of real time tasks on multiprocessor systems
129. Problem partitioning in parallel processor simulation systems
130. ISA: intelligent scheduling assistant
131. A survey of scheduling rules
132. The time-dependent travelling salesman problem and its application to the tardiness problem in one-machine scheduling
133. Algorithms for scheduling a single machine to minimize the weighted number of late jobs
134. Scheduling of precedence-constrained tasks on multiprocessors
135. Efficient scheduling algorithms for real-time multiprocessor systems
136. The complexity of preemptive scheduling given interprocessor communication delays
137. Minimizing total costs in one-machine scheduling
138. A recent survey of production scheduling
139. Short-term scheduling of vessels for shipping bulk or semi-bulk commodities originating in a single area
140. Algorithms for scheduling independent tasks
141. General techniques for combinatorial approximation
142. Combinatorial problems: reducibility and approximation
143. Scheduling nonpreemptable dependent operations of unequal processing times on nonidentical machines — a state space approach
144. Scheduling multi-operational tasks on nonidentical machines as a time-optimal control problem
145. Scheduling independent tasks with deadlines on semi-identical processors
146. An expediting heuristic for the shortest processing time dispatching rule
147. On the complexity of mean flow time scheduling
148. Decomposition algorithms for single-machine sequencing with precedence relations and deferal costs
149. Optimal single-machine scheduling with earliness and tardiness penalties
150. A tutorial on heuristic methods
151. Combined routing and scheduling for the transportation of containerized cargo
152. Probabilistic analysis of combinatorial algorithms: a bibliography with selected annotation
153. Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
154. Modelling and solving multicriteria project scheduling problems
155. Various optimizers for single-stage production
156. Algorithms for the vehicle routing and scheduling problems with time window constraints
157. Worst-case analysis of a scheduling algorithm
158. Generalized worst-case bounds for an homogeneous multiprocessor model with independent memories-completion time performance criterion
159. Analysis of the QAD algorithm for an homogeneous multiprocessor computing model with independent memories
160. A survey of artificial intelligence-based scheduling systems
161. A combinatorial approach to dynamic scheduling problems
162. Optimal two-machine orderings in the 3 × n flow-shop problem
163. Optimal grouping and dependent tasks for parallel scheduling
164. Task grouping and scheduling for parallel processing: application to robot kinematics and dynamics
165. AI techniques in computer-aided manufacturing systems
166. Optimal task scheduling via the LPT and MULTIFIT heuristics under a geometric progression condition
167. Control in resource allocation systems
168. Multiprocessor scheduling with memory allocation — a deterministic approach
169. Modelling and control of dynamic resource allocation project scheduling systems
170. The influence of setup time on job shop performance
171. Optimal scheduling control of a flexible machine