Preemptive scheduling with availability constraints to minimize total weighted completion times
From MaRDI portal
Publication:1772973
DOI10.1007/s10479-004-5032-zzbMath1119.90023OpenAlexW2041682173WikidataQ57185955 ScholiaQ57185955MaRDI QIDQ1772973
Guoqing Wang, Chengbin Chu, Hongyi Sun
Publication date: 22 April 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-004-5032-z
Related Items
Multitasking via alternate and shared processing: algorithms and complexity, 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, Dual Techniques for Scheduling on a Machine with Varying Speed, Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance, Minimizing total weighted late work on a single-machine with non-availability intervals, Single machine scheduling with non-availability interval and optional job rejection, Optimal Algorithms and a PTAS for Cost-Aware Scheduling, Minimizing total completion time on a single machine with a flexible maintenance activity, The symmetric quadratic knapsack problem: approximation and scheduling applications, A strongly polynomial FPTAS for the symmetric quadratic knapsack problem, Multi-coloring and job-scheduling with assignment and incompatibility costs, Single machine scheduling with semi-resumable machine 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 an availability constraint to minimize the weighted sum of the completion times, Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period, Optimal algorithms for scheduling under time-of-use tariffs, Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance, Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications, Single-machine common due date total earliness/tardiness scheduling with machine unavailability, Modeling single machine preemptive scheduling problems for computational efficiency, Solving an integrated job-shop problem with human resource constraints, Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance, Exponential inapproximability and FPTAS for scheduling with availability constraints, 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
- Unnamed Item
- Single machine flow-time scheduling with a single breakdown
- Machine scheduling with availability constraints
- Current trends in deterministic scheduling
- A 1. 47-approximation for a preemptive single-machine scheduling problem
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Scheduling with limited machine availability
- Machine scheduling with an availability constraint
- Single Machine Scheduling with Release Dates
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
