Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
From MaRDI portal
Cited in
(42)- Scheduling with families of jobs and delivery coordination under job availability
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
- A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem
- Local search procedures for improving feasible solutions to the sequential ordering problem
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Batch scheduling to minimize maximum lateness
- Minimizing maximum lateness with job families
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Solving the medium newspaper production/distribution problem
- A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
- A polynomial algorithm for lot-size scheduling of two type tasks.
- Linear time approximation schemes for vehicle scheduling problems
- Lot-size scheduling of two types of jobs on identical machines
- Scheduling with batching: A review
- On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
- Approximating the minmax rooted-tree cover in a tree
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
- Approximation algorithms for problems in scheduling with set-ups
- Batch scheduling and common due-date assignment on a single machine
- Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues
- Integer knapsack problems with set-up weights
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption
- Scheduling with few changes
- Scheduling two job families on a single machine with two competitive agents
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Impact of sequence-dependent setup time on job shop scheduling performance
- Minimizing L max for the single machine scheduling problem with family set-ups
- scientific article; zbMATH DE number 1389747 (Why is no real title available?)
- An online algorithm for a problem in scheduling with set-ups and release times
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
- Minmax Tree Cover in the Euclidean Space
- A heuristic approach for single-machine scheduling with due dates and class setups.
- A note on the complexity of family scheduling to minimize the number of late jobs
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
- Limited integrated production scheduling and vehicle routing in the steel industry
- Scheduling with locality by routing
- Batch sizing and job sequencing on a single machine
- The coordination of scheduling and batch deliveries
- 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: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4167580)
