Priority rules for job shops with weighted tardiness costs
Management Science
Spike: AI scheduling for NASA's Hubble Space Telescope
Proceedings of the sixth conference on Artificial intelligence applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A planning/scheduling methodology for the constrained resource problem
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Constraint-based methods for scheduling discretionary services
AI Communications
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
On-line planning and scheduling: an application to controlling modular printers
Journal of Artificial Intelligence Research
Scheduling a single robot in a job-shop environment through precedence constraint posting
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
MAK₠: a system for modelling, optimising, and analyzing production in small and medium enterprises
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
AFSCN scheduling: How the problem and solution have evolved
Mathematical and Computer Modelling: An International Journal
AdSCHE: DESIGN OF AN AUCTION-BASED FRAMEWORK FOR DECENTRALIZED SCHEDULING
Journal of Integrated Design & Process Science
Hi-index | 0.00 |
In this paper, we define and empirically evaluate new heuristics for solving the job shop scheduling problem with non-relaxable time windows. The hypothesis underlying our approach is that by approaching the problem as one of establishing sequencing constraints between pairs of operations requiring the same resource (as opposed to a problem of assigning start times to each operation) and by exploiting previously developed analysis techniques for limiting search through the space of possible sequencing decisions, simple, localized look-ahead techniques can yield problem solving performance comparable to currently dominating techniques that rely on more sophisticated analysis of resource contention. We define a series of attention focusing heuristics based on simple analysis of the temporal flexibility associated with different sequencing decisions, and a similarly motivated heuristic for determining how to sequence a given operation pair. Performance results are reported on a suite of benchmark problems previously investigated by two advanced approaches, and our simplified look-ahead analysis techniques are shown to provide comparable problem solving leverage at reduced computational cost.