A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
From MaRDI portal
Publication:1683059
DOI10.1016/j.ejor.2017.03.003zbMath1375.90126OpenAlexW2593172254MaRDI QIDQ1683059
Oliver Hinder, Andrew J. Mason
Publication date: 6 December 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.003
Related Items (4)
Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production ⋮ On competitive analysis for polling systems ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
Uses Software
Cites Work
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- Mathematical programming formulations for machine scheduling: A survey
- Single facility multi-class job scheduling
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
- Batch scheduling to minimize maximum lateness
- Single machine scheduling with batch set-up times to minimize maximum lateness
- Minimizing maximum lateness with job families
- Structure of a simple scheduling polyhedron
- Scheduling with batching: A review
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- Family sequencing and cooperation
- The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
- A survey of scheduling problems with setup times or costs
- An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
- Time-Indexed Formulations and the Total Weighted Tardiness Problem
- A study of integer programming formulations for scheduling problems
- Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
- On the facial structure of scheduling polyhedra
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- On the Complexity of Scheduling with Batch Setup Times
- Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Scheduling Groups of Jobs on a Single Machine
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
