Scheduling two parallel machines with machine-dependent availabilities
DOI10.1016/J.COR.2016.01.021zbMATH Open1349.90352OpenAlexW2263946527MaRDI QIDQ342363FDOQ342363
Authors: Dehua Xu, Qingguo Li, Jie He 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.021
Recommendations
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Minimizing makespan for two parallel machines with job limit on each availability interval
- Makespan minimization for two parallel machines with an availability constraint
- Parallel-machine scheduling with time-dependent and machine availability constraints
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- Single-machine scheduling with periodic maintenance to minimize makespan
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Scheduling the maintenance on a single machine
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Single-machine scheduling with flexible and periodic maintenance
- Scheduling with tool changes to minimize total completion time under controllable machining conditions
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Scheduling jobs under increasing linear machine maintenance time
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
Cited In (4)
- Minimizing makespan for two parallel machines with job limit on each availability interval
- Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
- Unknown Input Observers Designed by Eigenstructure Assignment
This page was built for publication: Scheduling two parallel machines with machine-dependent availabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342363)
