Optimal scheduling of products with common and unique components

DOI10.1080/00207729608929225zbMath0849.90074OpenAlexW2111834095MaRDI QIDQ4883817

Ching-Jong Liao

Publication date: 2 July 1996

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729608929225

zbMATH Keywords

total flow timework-in-process inventorybatching and sequencing decisionscommon and unique components

Mathematics Subject Classification ID

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

Related Items (1)

Optimal scheduling of two-component products on a single facility

Cites Work

• Batching in single operation manufacturing systems
• Batching to Minimize Flow Times on One Machine
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints

This page was built for publication: Optimal scheduling of products with common and unique components