THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE

DOI10.1142/S0217595909002249zbMath1176.90244OpenAlexW2091790639MaRDI QIDQ3392292

Guo Sun, Jianfeng Ren, Yu-Zhong Zhang

Publication date: 14 August 2009

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595909002249

zbMATH Keywords

schedulingNP-hardnessbatching machinelate work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ A single machine scheduling problem to minimize total early work ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Variable neighborhood search for the single machine scheduling problem to minimize the total early work ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling a single machine to minimize total late work
• Scheduling a batching machine
• Approximation algorithms in batch processing
• Scheduling one batch processor subject to job release dates
• On scheduling an unbounded batch machine
• Minimizing total completion time on a batch processing machine with job families
• Single Machine Scheduling to Minimize Total Late Work
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work

This page was built for publication: THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE