Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
From MaRDI portal
Publication:690456
DOI10.1016/j.tcs.2012.08.022zbMath1252.90027OpenAlexW2069389071MaRDI QIDQ690456
Cuixia Miao, Cuilian Wu, Yu-Zhong Zhang
Publication date: 27 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.022
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (8)
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ Scheduling simple linear deteriorating jobs with rejection ⋮ Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine ⋮ Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times ⋮ Single machine serial-batching scheduling with independent setup time and deteriorating job processing times ⋮ Complexity of scheduling with proportional deterioration and release dates ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Parallel-machine scheduling of simple linear deteriorating jobs
- Single machine parallel-batch scheduling with deteriorating jobs
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- Scheduling a batching machine
- Scheduling jobs under simple linear deterioration
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- Single machine scheduling with deadlines and increasing rates of processing times
- Scheduling one batch processor subject to job release dates
- Parallel machine scheduling with time dependent processing times
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- Scheduling with batching: A review
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Groups of Jobs on a Single Machine
- Multi-Machine Scheduling With Linear Deterioration
- Minimizing maximum lateness under linear deterioration
- Single machine scheduling with step-deteriorating processing times
This page was built for publication: Scheduling of deteriorating jobs with release dates to minimize the maximum lateness