The shifting bottleneck procedure for job shop scheduling
Management Science
Artificial Intelligence - Special issue on knowledge representation
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Generating feasible schedules under complex metric constraints
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
NP-hardness of shop-scheduling problems with three jobs
Discrete Applied Mathematics
A Constraint-Based Method for Project Scheduling with Time Windows
Journal of Heuristics
A Racing Algorithm for Configuring Metaheuristics
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
AI Communications - Constraint Programming for Planning and Scheduling
Job shop scheduling with setup times, deadlines and precedence constraints
Journal of Scheduling
Stochastic procedures for generating feasible schedules
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A Tabu search algorithm to minimize lateness in scheduling problems with setup times
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
This paper presents a heuristic algorithm for solving a job-shop scheduling problem with sequence dependent setup times and min/max separation constraints among the activities (SDST-JSSP/max). The algorithm relies on a core constraint-based search procedure, which generates consistent orderings of activities that require the same resource by incrementally imposing precedence constraints on a temporally feasible solution. Key to the effectiveness of the search procedure is a conflict sampling method biased toward selection of most critical conflicts and coupled with a non-deterministic choice heuristic to guide the base conflict resolution process. This constraint-based search is then embedded within a larger iterative-sampling search framework to broaden search space coverage and promote solution optimization. The efficacy of the overall heuristic algorithm is demonstrated empirically both on a set of previously studied job-shop scheduling benchmark problems with sequence dependent setup times and by introducing a new benchmark with setups and generalized precedence constraints.