Optimal flowshop schedules with no intermediate storage space

DOI10.1002/NAV.3800230206MaRDI QIDQ4094642zbMATH OpenOpenAlexFDO

Authors Jatinder N. D. Gupta

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(11)

• Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
• On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
• Production scheduling with applications in the printing industry
• A review of TSP based approaches for flowshop scheduling
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• Flow-Shop Sequencing with no Intratnachine Waiting: Minimization of Total Waiting Cost
• Minimizing total completion time in two-machine flow shops with exact delays
• 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

This page was built for publication: Optimal flowshop schedules with no intermediate storage space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094642)