Lot sizing in a no-wait flow shop

DOI10.1016/0167-6377(95)00008-8zbMath0836.90094OpenAlexW1979460017MaRDI QIDQ1904756

Kamlesh Mathur, Hamilton Emmons

Publication date: 7 January 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00008-8

zbMATH Keywords

traveling salesmansequencingno-wait flow shop

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (2)

An efficient column-generation-based algorithm for solving a pickup-and-delivery problem ⋮ Many-visits TSP revisited

Cites Work

• Unnamed Item
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Complexity of Scheduling Shops with No Wait in Process
• Counterexamples to optimal permutation schedules for certain flow shop problems
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues

This page was built for publication: Lot sizing in a no-wait flow shop