Parallel-batch scheduling with two models of deterioration to minimize the makespan
Summary: We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is \(p_j = a_j + \alpha t\) and of the second model is \(p_j = a + \alpha_j t\). The objective is to minimize the makespan. We present \(O(n \text{log} n)\) time algorithms for the single-machine problems, respectively. And we propose fully polynomial time approximation schemes to solve the identical-parallel-machine problem and uniform-parallel-machine problem, respectively.
- 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
- Batch scheduling with deteriorating jobs to minimize the total completion time
- Single machine parallel-batch scheduling with deteriorating jobs
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- A concise survey of scheduling with time-dependent processing times
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- scientific article; zbMATH DE number 7492226 (Why is no real title available?)
- 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 a batching machine
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling with batching: A review
- Single machine parallel-batch scheduling with deteriorating jobs
- Time-dependent scheduling
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- Batch scheduling with proportional-linear deterioration and outsourcing
- Batch scheduling of deteriorating reworkables
- A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing
This page was built for publication: Parallel-batch scheduling with two models of deterioration to minimize the makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1724245)
