Single-machine batch scheduling of linear deteriorating jobs

DOI10.1016/j.tcs.2015.02.025zbMath1311.90047OpenAlexW2036675142MaRDI QIDQ2344768

Min Ji, Qinyun Yang, Danli Yao, Cheng, T. C. Edwin

Publication date: 18 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.025

zbMATH Keywords

batchschedulingdeteriorating jobsNP-hardnessFPTASnon-approximability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities ⋮ Parallel-machine scheduling in shared manufacturing

Cites Work

• Unnamed Item
• Online batch scheduling on parallel machines with delivery times
• Parallel-machine scheduling of simple linear deteriorating jobs
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
• Batch delivery scheduling with batch delivery cost on a single machine
• Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
• Single machine scheduling with batch deliveries
• The complexity of one-machine batching problems
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
• Machine scheduling with job delivery coordination
• Scheduling with batching: A review
• A survey of scheduling problems with setup times or costs
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Parametric problem in scheduling theory
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Batch Delivery Scheduling on a Single Machine
• A logistics scheduling model: Inventory cost reduction by batching
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem

This page was built for publication: Single-machine batch scheduling of linear deteriorating jobs