Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
From MaRDI portal
(Redirected from Publication:690456)
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7492226 (Why is no real title available?)
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing maximum lateness under linear deterioration
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Multi-Machine Scheduling With Linear Deterioration
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with time dependent processing times
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Parallel-machine scheduling of simple linear deteriorating jobs
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Scheduling Groups of Jobs on a Single Machine
- Scheduling a batching machine
- Scheduling jobs under simple linear deterioration
- Scheduling one batch processor subject to job release dates
- Scheduling with batching: A review
- Single machine parallel-batch scheduling with deteriorating jobs
- Single machine scheduling with deadlines and increasing rates of processing times
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Single machine scheduling with step-deteriorating processing times
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)
