Optimal flowshop schedules with no intermediate storage space
From MaRDI portal
Publication:4094642
DOI10.1002/nav.3800230206zbMath0328.90038OpenAlexW2019529588MaRDI QIDQ4094642
Publication date: 1976
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800230206
Related Items
A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage., Solving the continuous flow-shop scheduling problem by metaheuristics., Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, Fitness landscape analysis for the no-wait flow-shop scheduling problem, On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties, Minimizing total completion time in two-machine flow shops with exact delays, Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds, Flow-Shop Sequencing with no Intratnachine Waiting: Minimization of Total Waiting Cost, Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays, A review of TSP based approaches for flowshop scheduling, Production scheduling with applications in the printing industry
