Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
From MaRDI portal
Publication:690456
DOI10.1016/J.TCS.2012.08.022zbMATH Open1252.90027OpenAlexW2069389071MaRDI QIDQ690456FDOQ690456
Authors: Cuixia Miao, Cuilian Wu, Yuzhong 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
Recommendations
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Due-date assignment and single machine scheduling with deteriorating jobs
- Scheduling deteriorating jobs to minimize makespan
- On a scheduling problem of time deteriorating jobs
- Due-date assignment and parallel-machine scheduling with deteriorating jobs
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Scheduling with batching: A review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- Scheduling a batching machine
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- Scheduling one batch processor subject to job release dates
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling Groups of Jobs on a Single Machine
- Single machine scheduling with deadlines and increasing rates of processing times
- Minimizing maximum lateness under linear deterioration
- Single machine parallel-batch scheduling with deteriorating jobs
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Single machine scheduling with step-deteriorating processing times
- Parallel-machine scheduling of simple linear deteriorating jobs
- Scheduling jobs under simple linear deterioration
- 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
- Multi-Machine Scheduling With Linear Deterioration
- Parallel machine scheduling with time dependent processing times
- Title not available (Why is that?)
Cited In (14)
- Trading off due-date tightness and job tardiness in a basic scheduling model
- New bounds for single-machine time-dependent scheduling with uniform deterioration
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Due-date assignment and parallel-machine scheduling with deteriorating jobs
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
- Complexity of scheduling with proportional deterioration and release dates
- Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- 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
- Scheduling with step-deteriorating jobs to minimize the makespan
- Scheduling simple linear deteriorating jobs with rejection
This page was built for publication: Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690456)
