Parallel-batch scheduling with two models of deterioration to minimize the makespan

DOI10.1155/2014/495187zbMath1470.90029OpenAlexW2157002300WikidataQ59038763 ScholiaQ59038763MaRDI QIDQ1724245

Cuixia Miao

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/495187

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Batch scheduling with proportional-linear deterioration and outsourcing

Cites Work

• Unnamed Item
• An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Parallel-machine scheduling of simple linear deteriorating jobs
• A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
• Time-dependent scheduling
• Single machine parallel-batch scheduling with deteriorating jobs
• Scheduling a batching machine
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
• Scheduling with batching: A review
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Scheduling Deteriorating Jobs on a Single Processor

This page was built for publication: Parallel-batch scheduling with two models of deterioration to minimize the makespan