THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
From MaRDI portal
Publication:3392292
DOI10.1142/S0217595909002249zbMATH Open1176.90244OpenAlexW2091790639MaRDI QIDQ3392292FDOQ3392292
Yuzhong Zhang, Guo Sun, Jianfeng Ren
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
Recommendations
- scientific article; zbMATH DE number 2190176
- On scheduling an unbounded batch machine
- scientific article; zbMATH DE number 1559487
- The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
Cites Work
- Title not available (Why is that?)
- Scheduling a batching machine
- Scheduling one batch processor subject to job release dates
- On scheduling an unbounded batch machine
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Approximation algorithms in batch processing
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing total completion time on a batch processing machine with job families
- Single Machine Scheduling to Minimize Total Late Work
- Approximation algorithms for scheduling a single machine to minimize total late work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
Cited In (11)
- Scheduling with competing agents, total late work and job rejection
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work
- Minimizing total late work on a single machine with generalized due-dates
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Title not available (Why is that?)
- A two-agent single-machine scheduling problem with late work criteria
- A single machine scheduling problem to minimize total early work
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
This page was built for publication: THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392292)
