The shifting bottleneck procedure for job shop scheduling
Management Science
An algorithm for solving the job-shop problem
Management Science
A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Multiple-Machine Lower Bounds for Shop-Scheduling Problems
INFORMS Journal on Computing
International Journal of Computer Integrated Manufacturing - Industrial Engineering and Systems Management
A survey of scheduling with deterministic machine availability constraints
Computers and Industrial Engineering
Fuzzy job shop scheduling problem with availability constraints
Computers and Industrial Engineering
An effective heuristic for flexible job-shop scheduling problem with maintenance activities
Computers and Industrial Engineering
Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability
Computers and Industrial Engineering
Hybrid genetic algorithm for the flexible job-shop problem under maintenance constraints
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Single machine scheduling with small operator-non-availability periods
Journal of Scheduling
Hi-index | 0.00 |
In this paper we deal with variants of traditional cases of unavailability constraints in scheduling problems. In the literature, two main approaches are usually found. In the first one, operations can be interrupted by unavailability periods and in the second one, operations cannot be interrupted. The context we consider is more general; some operations can be interrupted, the others cannot. Moreover, we assume that information can be related to operations as well as to unavailability periods. Consequently an unavailability period can make possible or not the interruption of an operation. As an application to this new problem, the single machine problem with heads and tails and the job-shop scheduling problem are tackled. All combinations of possible cases are studied and after a review of the state-of-the-art, branch-and-bound algorithms are proposed to solve these problems. Finally, computational experiments are conducted and discussed.