Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
From MaRDI portal
Publication:2467254
DOI10.1016/j.ejor.2006.06.062zbMath1137.90494OpenAlexW1997449826WikidataQ57185842 ScholiaQ57185842MaRDI QIDQ2467254
Publication date: 21 January 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.062
Related Items (21)
Scheduling jobs and maintenance activities on parallel machines ⋮ Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates ⋮ Single machine scheduling with non-availability interval and optional job rejection ⋮ Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ Minimizing total weighted completion time with an unexpected machine unavailable interval ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ Approximation schemes for parallel machine scheduling with availability constraints ⋮ Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem ⋮ Single-machine scheduling with machine unavailability periods and resource dependent processing times ⋮ Cost allocation in rescheduling with machine unavailable period ⋮ Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications ⋮ Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval ⋮ Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints ⋮ Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance ⋮ Online scheduling to minimize modified total tardiness with an availability constraint ⋮ Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times ⋮ Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
Cites Work
- Single machine flow-time scheduling with scheduled maintenance
- Single machine flow-time scheduling with a single breakdown
- Machine scheduling with availability constraints
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Scheduling with limited machine availability
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- A survey of scheduling problems with setup times or costs
- Scheduling the maintenance on a single machine
- Two-machine open shop scheduling with an availability constraint
- Unnamed Item
This page was built for publication: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
