Scheduling with few changes
From MaRDI portal
Publication:299829
DOI10.1016/j.ejor.2013.11.011zbMath1338.90177OpenAlexW2085975284MaRDI QIDQ299829
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.011
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (3)
An algorithmic framework for tool switching problems with multiple objectives ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ Minimizing the number of switch instances on a flexible machine in polynomial time
Cites Work
- Assignment problems: a golden anniversary survey
- Tackling the jump number of interval orders
- Assignment problems with changeover cost
- A survey of scheduling problems with setup times or costs
- The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm
- Lot-Sizing with Start-Up Times
- Facets and Reformulations for Solving Production Planning With Changeover Costs
- Optimal Linear Extensions by Interchanging Chains
- Some Optimum Algorithms for Scheduling Problems with Changeover Costs
- Deterministic Production Planning: Algorithms and Complexity
- Minimizing Setups for Cycle-Free Ordered Sets
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- On the Complexity of Scheduling with Batch Setup Times
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Scheduling with few changes
