Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
From MaRDI portal
Publication:2467254
Recommendations
- A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- The worst-case performance ratio with time-dependent single-scheduling problems
- Single machine scheduling problems with position-dependent processing times
- scientific article; zbMATH DE number 1004261
Cites work
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A survey of scheduling problems with setup times or costs
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Machine scheduling with availability constraints
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Scheduling the maintenance on a single machine
- Scheduling with limited machine availability
- Single machine flow-time scheduling with a single breakdown
- Single machine flow-time scheduling with scheduled maintenance
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Two-machine open shop scheduling with an availability constraint
Cited in
(21)- Scheduling jobs and maintenance activities on parallel machines
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Cost allocation in rescheduling with machine unavailable period
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
- Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- The third comprehensive survey on scheduling problems with setup times/costs
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- 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
- Single machine scheduling with non-availability interval and optional job rejection
- Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
- Approximation schemes for parallel machine scheduling with availability constraints
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Single-machine scheduling with machine unavailability periods and resource dependent processing times
This page was built for publication: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467254)
