Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
From MaRDI portal
Publication:2182772
DOI10.1007/s11590-019-01389-xzbMath1445.90036OpenAlexW2910807099WikidataQ128537423 ScholiaQ128537423MaRDI QIDQ2182772
Panos M. Pardalos, Jun Pei, Zhiping Zhou, Min Kong, Xin-Bao Liu
Publication date: 26 May 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01389-x
deteriorating jobssetup timedynamic programming algorithmjob rejectionparallel-batching schedulingnon-identical sizes
Related Items
Improved DE search for competing groups scheduling with deterioration effects, Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine, Parallel-batch scheduling with deterioration and rejection on a single machine, Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection, Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop, Single machine lot scheduling with optional job-rejection, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- A concise survey of scheduling with time-dependent processing times
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Batch scheduling with proportional-linear deterioration and outsourcing
- Minimizing the makespan on a single parallel batching machine
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a single batch processing machine with non-identical job sizes
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
- Multiprocessor Scheduling with Rejection
- Λ-Shaped Policies to Schedule Deteriorating Jobs
