Batch scheduling to minimize maximum lateness
From MaRDI portal
(Redirected from Publication:1373461)
Recommendations
- Single machine scheduling with batch set-up times to minimize maximum lateness
- Batch scheduling to minimize total completion time
- Minimizing maximum lateness with job families
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
- Improved dynamic programs for some batching problems involving the maximum lateness criterion
Cites work
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- Batch scheduling to minimize total completion time
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- scientific article; zbMATH DE number 3632203 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- On the Complexity of Scheduling with Batch Setup Times
- Scheduling Groups of Jobs on a Single Machine
- Scheduling two job classes on a single machine
- Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
Cited in
(21)- A simulated annealing algorithm for single machine scheduling problems with family setups
- Minimizing maximum lateness with job families
- Improved dynamic programs for some batching problems involving the maximum lateness criterion
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Minimizing the maximum flow time in batch scheduling
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
- Batch scheduling to minimize total completion time
- Scheduling with batching: A review
- Scheduling the production of two-component jobs on a single machine
- On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times
- Single machine batch scheduling with non-increasing time slot costs
- Scheduling two job families on a single machine with two competitive agents
- Single machine scheduling to minimize the setup time and the earliness
- Scheduling to minimize the total compression and late costs
- Optimizing static calendar queues
- scientific article; zbMATH DE number 1932366 (Why is no real title available?)
- scientific article; zbMATH DE number 7070855 (Why is no real title available?)
- The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan
This page was built for publication: Batch scheduling to minimize maximum lateness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373461)
