Batch scheduling with proportional-linear deterioration and outsourcing
Summary: We consider the bounded parallel-batch scheduling with proportional-linear deterioration and outsourcing, in which the actual processing time is \(p_j = \alpha_j(A + D t)\) or \(p_j = \alpha_j t\). A job is either accepted and processed in batches on a single machine by manufactures themselves or outsourced to the third party with a certain penalty having to be paid. The objective is to minimize the maximum completion time of the accepted jobs and the total penalty of the outsourced jobs. For the \(p_j = \alpha_j(A + D t)\) model, when all the jobs are released at time zero, we show that the problem is NP-hard and present a pseudo-polynomial time algorithm, respectively. For the \(p_j = \alpha_j t\) model, when the jobs have distinct \(m (<n)\) release dates, we provide a dynamic programming algorithm, where \(n\) is the number of jobs.
- Batch scheduling with deteriorating jobs to minimize the total completion time
- Single machine parallel-batch scheduling with deteriorating jobs
- Parallel-batch scheduling with two models of deterioration to minimize the makespan
- Batch scheduling of deteriorating products
- An online batch scheduling with linear deterioration effect
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
- 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
- scientific article; zbMATH DE number 2186123 (Why is no real title available?)
- scientific article; zbMATH DE number 7492226 (Why is no real title available?)
- Multiprocessor Scheduling with Rejection
- Parallel-batch scheduling with two models of deterioration to minimize the makespan
- Parallel-machine scheduling of simple linear deteriorating jobs
- Scheduling a batching machine
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling jobs under simple linear deterioration
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling with batching: A review
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Time-dependent scheduling
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
- Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
- Batch scheduling of deteriorating reworkables
This page was built for publication: Batch scheduling with proportional-linear deterioration and outsourcing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992948)
