Rotation cycle schedulings for multi-item production systems.

DOI10.1016/S0377-2217(00)00317-9zbMath1051.90012OpenAlexW1976048554MaRDI QIDQ5952441

Yuyue Song, Gin Hor Chan

Publication date: 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00317-9

zbMATH Keywords

Branch and bound algorithmRotation cycleTravelling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production theory, theory of the firm (91B38)

Cites Work

• Unnamed Item
• Unnamed Item
• The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
• Note: Dynamic lot sizing for a finite rate input process
• On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine

This page was built for publication: Rotation cycle schedulings for multi-item production systems.