THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
From MaRDI portal
Publication:3392292
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
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- Approximation algorithms for scheduling a single machine to minimize total late work
- Approximation algorithms in batch processing
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Minimizing total completion time on a batch processing machine with job families
- On scheduling an unbounded batch machine
- Scheduling a batching machine
- Scheduling one batch processor subject to job release dates
- Single Machine Scheduling to Minimize Total Late Work
Cited in
(11)- A single machine scheduling problem to minimize total early work
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- 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
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Scheduling with competing agents, total late work and job rejection
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- A two-agent single-machine scheduling problem with late work criteria
- scientific article; zbMATH DE number 2190176 (Why is no real title available?)
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work
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)
