Single machine flow-time scheduling with a single breakdown
Acta Informatica
Parallel machines scheduling with nonsimultaneous machine available time
Discrete Applied Mathematics
The lessons of flowshop scheduling research
Operations Research
Single machine flow-time scheduling with scheduled maintenance
Acta Informatica
Capacitated two-parallel machines scheduling to minimize sum of job completion times
Discrete Applied Mathematics
A polynomial approximation scheme for a constrained flow-shop scheduling problem
Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing the sum of job completion times on capacitated parallel machines
Mathematical and Computer Modelling: An International Journal
Minimizing makespan in hybrid flowshops
Operations Research Letters
Information Processing Letters
Single-machine scheduling with periodic maintenance and nonresumable jobs
Computers and Operations Research
Information Processing Letters
Scheduling two-stage hybrid flow shop with availability constraints
Computers and Operations Research
Computers and Operations Research
Computers and Operations Research
A two-machine flowshop scheduling problem with a separated maintenance constraint
Computers and Operations Research
Integrated production planning and preventive maintenance in deteriorating production systems
Information Sciences: an International Journal
Approximation results for flow shop scheduling problems with machine availability constraints
Computers and Operations Research
Heuristic algorithms for two-machine flowshop with availability constraints
Computers and Industrial Engineering
Computers and Operations Research
Computers and Industrial Engineering
Robotics and Computer-Integrated Manufacturing
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints
Computers and Industrial Engineering
Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
Computers & Mathematics with Applications
Scheduling two-stage hybrid flow shop with availability constraints
Computers and Operations Research
A survey of scheduling with deterministic machine availability constraints
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability
Computers and Industrial Engineering
Scheduling jobs and preventive maintenance activities on parallel machines
ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
Incorporating periodic preventive maintenance into flexible flowshop scheduling problems
Applied Soft Computing
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
Expert Systems with Applications: An International Journal
Population-based dynamic scheduling optimisation for complex production process
International Journal of Computer Applications in Technology
An improved heuristic for two-machine flowshop scheduling with an availability constraint
Operations Research Letters
Two-machine open shop scheduling with an availability constraint
Operations Research Letters
Two-machine flow shop scheduling problems with no-wait jobs
Operations Research Letters
Hi-index | 0.00 |
This paper studies a two-machine flowshop scheduling problem with an availability constraint. Contrary to most literature where machines are available at all times, we assure that a machine may not always be available. The problem is very important, as it happens often in the industry. For example, a machine may not be available in the scheduling period due to a breakdown or preventive maintenance. Also if a machine continues to process those unfinished jobs that were scheduled in the previous planning period, then it is not available at the beginning of the period. We study the problem under a deterministic environment. Namely, we assume that the unavailable time is known in advance. We prove that the problem is NP-hard. We then develop pseudo-polynomial dynamic programming algorithm to solve the problem optimally. We also provide heuristic algorithms with an error bound analysis. In particular, we propose two O(n log n) time heuristic algorithms. The first heuristic is used to solve the problem with an availability constraint imposed on machine 1, and has a worst case error bound of 12. The second heuristic is used to solve the problem with an availability constraint imposed on machine 2, and has a worst case error bound of 13. We note that the problem is not reversible, in the sense that interchanging job processing time on machine 1 and 2 will not yield an equivalent problem, which is different from the standard flowshop problem.