Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs

DOI10.1016/j.ipl.2011.05.018zbMath1260.68040OpenAlexW2116587896MaRDI QIDQ1944138

Cuixia Miao, Zhigang Cao, Yu-Zhong Zhang

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.018

zbMATH Keywords

analysis of algorithmsNP-hardparallel-batch schedulingdeteriorating jobfully polynomial time approximation scheme (FPTAS)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (12)

Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan ⋮ Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance ⋮ Batch scheduling with deteriorating jobs to minimize the total completion time ⋮ Single-machine scheduling with accelerating deterioration effects ⋮ Parallel-batch scheduling with two models of deterioration to minimize the makespan ⋮ Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times ⋮ Batch scheduling with proportional-linear deterioration and outsourcing ⋮ An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs ⋮ Scheduling of deteriorating jobs with release dates to minimize the maximum lateness ⋮ Single machine serial-batching scheduling with independent setup time and deteriorating job processing times ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• Parallel-machine scheduling of simple linear deteriorating jobs
• Single machine parallel-batch scheduling with deteriorating jobs
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Scheduling a batching machine
• Scheduling jobs under simple linear deterioration
• Single machine scheduling with start time dependent processing times: Some solvable cases
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• Scheduling one batch processor subject to job release dates
• Parallel machine scheduling with time dependent processing times
• Scheduling with batching: A review
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Groups of Jobs on a Single Machine
• Multi-Machine Scheduling With Linear Deterioration
• Single machine scheduling with step-deteriorating processing times

This page was built for publication: Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs