Scheduling with few changes

DOI10.1016/J.EJOR.2013.11.011MaRDI QIDQ299829zbMATH OpenOpenAlexFDO

Authors Torsten Mütze

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

zbMATH Keywords

algorithmassignment problemchangeover cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Recommendations

• Some Optimum Algorithms for Scheduling Problems with Changeover Costs
• scientific article; zbMATH DE number 1555983
• The changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm
• Reoptimization in machine scheduling
• Lot-size scheduling of two types of jobs on identical machines

Cites work

• scientific article; zbMATH DE number 1640601 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• A survey of scheduling problems with setup times or costs
• Assignment problems with changeover cost
• Assignment problems: a golden anniversary survey
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• Deterministic Production Planning: Algorithms and Complexity
• Facets and Reformulations for Solving Production Planning With Changeover Costs
• Handbook of applied optimization
• Lot-sizing with start-up times
• Minimizing Setups for Cycle-Free Ordered Sets
• Network flows. Theory, algorithms, and applications.
• On the Complexity of Scheduling with Batch Setup Times
• Optimal Linear Extensions by Interchanging Chains
• Scheduling algorithms
• Some Optimum Algorithms for Scheduling Problems with Changeover Costs
• Tackling the jump number of interval orders
• The changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm

Cited in

(4)

• Minimizing the number of grab's changes in a single machine scheduling problem
• 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
• An algorithmic framework for tool switching problems with multiple objectives

This page was built for publication: Scheduling with few changes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299829)