Single machine parallel-batch scheduling with deteriorating jobs
From MaRDI portal
Publication:1006057
DOI10.1016/j.tcs.2008.11.009zbMath1162.90015OpenAlexW2005319019MaRDI QIDQ1006057
Xianglai Qi, Shiguo Zhou, Jinjiang Yuan
Publication date: 17 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.009
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (16)
Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan ⋮ Batch scheduling with deteriorating jobs to minimize the total completion time ⋮ A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ Parallel-batch scheduling with deterioration and rejection on a single machine ⋮ Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs ⋮ Parallel-batch scheduling with two models of deterioration to minimize the makespan ⋮ A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities ⋮ 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 of deteriorating jobs with release dates to minimize the maximum lateness ⋮ Scheduling time-dependent jobs under mixed deterioration ⋮ Single machine serial-batching scheduling with independent setup time and deteriorating job processing times ⋮ Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan ⋮ Complexity of scheduling with proportional deterioration and release dates ⋮ Scheduling an unbounded batching machine with job processing time compatibilities
Cites Work
- Unnamed Item
- Unnamed Item
- Batch scheduling of step deteriorating jobs
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Scheduling jobs under decreasing linear deterioration
- Scheduling a batching machine
- Scheduling jobs under simple linear deterioration
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- Minimizing the total weighted completion time of deteriorating jobs
- Parallel machine scheduling with time dependent processing times
- Scheduling with batching: A review
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling Deteriorating Jobs on a Single Processor
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Minimizing maximum lateness under linear deterioration
- Single machine scheduling with step-deteriorating processing times
This page was built for publication: Single machine parallel-batch scheduling with deteriorating jobs
