Some Optimum Algorithms for Scheduling Problems with Changeover Costs

DOI10.1287/OPRE.35.1.94MaRDI QIDQ3758548zbMATH OpenOpenAlexFDO

Authors

Publication date 1987

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.35.1.94

zbMATH Keywords

changeover costassembly linemultiple identical production linesOptimum production schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

• The changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm
• Algorithms for Solving Production-Scheduling Problems
• A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
• Lot-size scheduling of two types of jobs on identical machines
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine

Cited in

(9)

• A polynomial algorithm for lot-size scheduling of two type tasks.
• Lot-size scheduling of two types of jobs on identical machines
• Optimal single machine scheduling of products with components and changeover cost
• Scheduling with few changes
• KBSS: A knowledge-based system for scheduling in automated manufacturing
• Modeling industrial lot sizing problems: a review
• Impact of sequence-dependent setup time on job shop scheduling performance
• A Lagrangean decomposition solution to a single line multiproduct scheduling problem
• The changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm

This page was built for publication: Some Optimum Algorithms for Scheduling Problems with Changeover Costs

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