Single machine flow-time scheduling with a single breakdown
Acta Informatica
Parallel machines scheduling with nonsimultaneous machine available time
Discrete Applied Mathematics
Single machine flow-time scheduling with scheduled maintenance
Acta Informatica
An NP-hard open shop scheduling problem with polynomial average time complexity
Mathematics of Operations Research
Capacitated two-parallel machines scheduling to minimize sum of job completion times
Discrete Applied Mathematics
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Journal of the ACM (JACM)
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
Discrete Applied Mathematics
Two-machine flowshop scheduling with consecutive availability constraints
Information Processing Letters
A note on “parallel machine scheduling with non-simultaneous machine available time”
Discrete Applied Mathematics
Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability
Computers and Industrial Engineering
Scheduling preemptable tasks on parallel processors with limited availability
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
Information Processing Letters
Information Processing Letters
Single-machine scheduling with periodic maintenance and nonresumable jobs
Computers and Operations Research
Information Processing Letters
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints
Information Processing Letters
Information Processing Letters
New Single Machine and Job-Shop Scheduling Problems with Availability Constraints
Journal of Scheduling
Computers and Operations Research
Scheduling linear deteriorating jobs with an availability constraint on a single machine
Theoretical Computer Science
Improved algorithms for two single machine scheduling problems
Theoretical Computer Science - Algorithmic applications in management
Computers and Operations Research
Computers and Operations Research
Computers and Industrial Engineering
Approximation results for flow shop scheduling problems with machine availability constraints
Computers and Operations Research
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
The effect of machine availability on the worst-case performance of LPT
Discrete Applied Mathematics
Optimal parallel machines scheduling with availability constraints
Discrete Applied Mathematics
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
An improved heuristic for two-machine flowshop scheduling with an availability constraint
Operations Research Letters
Operations Research Letters
Two-machine open shop scheduling with an availability constraint
Operations Research Letters
An effective heuristic for flexible job-shop scheduling problem with maintenance activities
Computers and Industrial Engineering
Computers & Mathematics with Applications
Minimizing total completion time on a single machine with a flexible maintenance activity
Computers and Operations Research
Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability
Computers and Industrial Engineering
Approximation algorithms for scheduling with a variable machine maintenance
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
Theoretical Computer Science
Unrelated parallel-machine scheduling with deteriorating maintenance activities
Computers and Industrial Engineering
Information Sciences: an International Journal
Approximation scheme for scheduling resumable proportionally deteriorating jobs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Parallel-machine scheduling with an availability constraint
Computers and Industrial Engineering
Computers & Mathematics with Applications
Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
Computers and Operations Research
Single machine scheduling with small operator-non-availability periods
Journal of Scheduling
Scheduling with due date assignment under special conditions on job processing
Journal of Scheduling
Integrated production scheduling and maintenance policy for robustness in a single machine
Computers and Operations Research
Computers and Operations Research
| Hi-index | 0.00 |
Various deterministic scheduling problems with availability constraints motivated by preventive maintenance attract more and more researchers. Many results involving this constraint have been published in recent years. But there is no recent paper to summarize them. To be convenient for interested researchers, we make this survey. In this paper, complexity results, exact algorithms and approximation algorithms in single machine, parallel machine, flow shop, open shop, job shop scheduling environment with different criteria are surveyed briefly.