Flow-shop batch scheduling with identical processing-time jobs

DOI10.1002/NAV.20028zbMath1075.90031OpenAlexW1969964771MaRDI QIDQ3156753

Daniel Oron, Gur Mosheiov, Ya'acov Ritov

Publication date: 11 January 2005

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20028

zbMATH Keywords

flow-timeflow-shopbatch-scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Scheduling a hybrid flowshop with batch production at the last stage ⋮ Batch scheduling on two-machine flowshop with machine-dependent setup times ⋮ Solving the serial batching problem in job shop manufacturing systems ⋮ A note on batch scheduling on a two-machine flowshop with machine-dependent processing times ⋮ A polynomial-time algorithm for a flow-shop batching problem with equal-length operations ⋮ Flow shop batching and scheduling with sequence-dependent setup times ⋮ A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups ⋮ Family scheduling with batch availability in flow shops to minimize makespan ⋮ A survey of scheduling problems with setup times or costs ⋮ Open-shop batch scheduling with identical jobs ⋮ Batching and scheduling in a multi-machine flow shop ⋮ Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop

This page was built for publication: Flow-shop batch scheduling with identical processing-time jobs