Minimum Change-Over Scheduling of Several Products on One Machine

DOI10.1287/OPRE.16.2.342MaRDI QIDQ5580092zbMATH OpenOpenAlexFDO

Authors C. Roger Glassey

Publication date 1968

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

operations research

Cited in

(13)

• A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem
• Studying the effects of production loss due to setup in dynamic production scheduling
• A Lagrangean decomposition solution to a single line multiproduct scheduling problem
• Scheduling in a sequence dependent setup environment with genetic search
• The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
• Scheduling under machine breakdown in a continuous process industry
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
• A polynomial algorithm for lot-size scheduling of two type tasks.
• Lot-size scheduling of two types of jobs on identical machines
• Impact of sequence-dependent setup time on job shop scheduling performance
• A framework for modelling setup carryover in the capacitated lot sizing problem
• Modeling industrial lot sizing problems: a review
• A heuristic approach for single-machine scheduling with due dates and class setups.

This page was built for publication: Minimum Change-Over Scheduling of Several Products on One Machine

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