Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan

DOI10.1016/j.ejor.2009.05.021zbMath1173.90407OpenAlexW2056680778MaRDI QIDQ1038382

Min Ji, Cheng, T. C. Edwin

Publication date: 17 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.021

zbMATH Keywords

computational complexitymakespanFPTASbatch scheduling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (13)

Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration ⋮ Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities ⋮ Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration ⋮ A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing ⋮ Optimal algorithms for online single machine scheduling with deteriorating jobs ⋮ Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness ⋮ A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines ⋮ Parallel-machine scheduling in shared manufacturing ⋮ Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty ⋮ Single-machine batch scheduling of linear deteriorating jobs ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS

Cites Work

• Unnamed Item
• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Batch scheduling of step deteriorating jobs
• 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
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• The complexity of one-machine batching problems
• Scheduling jobs under simple linear deterioration
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Parallel machine scheduling with time dependent processing times
• Scheduling with batching: A review
• A survey of scheduling problems with setup times or costs
• Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Multi-Machine Scheduling With Linear Deterioration
• The NP-completeness column: An ongoing guide

This page was built for publication: Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan