The shifting bottleneck procedure for job shop scheduling
Management Science
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
A fast taboo search algorithm for the job shop problem
Management Science
Creating a flexible, simulation-based finite scheduling tool
Proceedings of the 29th conference on Winter simulation
Efficient simulation/optimization of dispatching priority with “fake” processing time
Proceedings of the 29th conference on Winter simulation
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Management Science
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Recursive simulation to aid models of decision making
Proceedings of the 32nd conference on Winter simulation
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Dispatching heuristic for wafer fabrication
Proceedings of the 33nd conference on Winter simulation
Support to decision makers: the use of recursive simulation to support decisionmaking
Proceedings of the 35th conference on Winter simulation: driving innovation
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Hierarchical minimization of completion time variance and makespan in jobshops
Computers and Operations Research
Incremental HLA-based distributed simulation cloning
WSC '04 Proceedings of the 36th conference on Winter simulation
An urban terrain abstraction to support decisionmaking using recursive simulation
WSC '04 Proceedings of the 36th conference on Winter simulation
A new approach to multi-pass scheduling in shop floor control
WSC '04 Proceedings of the 36th conference on Winter simulation
A bee colony optimization algorithm to job shop scheduling
Proceedings of the 38th conference on Winter simulation
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Application of multi-objective bee colony optimization algorithm to automated red teaming
Winter Simulation Conference
Hi-index | 0.00 |
This paper presents a simulation based approach to improve on the mean cycle time performance of dispatching rules. The method applies recursive simulation technique on dispatching rules to search for new improved solutions for a set of job shop problems. Due to the nature of the recursive heuristic, performance criteria other than mean cycle time and various dispatching rules can be implemented into the recursive simulation framework without requiring too much effort. The performance of the proposed approach is compared to the underlying dispatching rules as well as a published tabu search procedure. The preliminary results show that the approach outperforms the underlying dispatching rules and is comparable to the tabu search procedure.