Flow-Shop Sequencing with no Intratnachine Waiting: Minimization of Total Waiting Cost

DOI10.1080/02522667.1981.10698709zbMath0468.90029OpenAlexW1973099428MaRDI QIDQ3922463

P. C. Bagga, K. R. Kalra

Publication date: 1981

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

minimization of total waiting costnxm flow-shop sequencing problemtwo successive machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal flowshop schedules with no intermediate storage space
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues

This page was built for publication: Flow-Shop Sequencing with no Intratnachine Waiting: Minimization of Total Waiting Cost