An exact solution with an improved running time for the routing flow shop problem with two machines

DOI10.1007/s10951-023-00784-8zbMATH Open1548.90198MaRDI QIDQ6620464

Alexander V. Kononov, Ilya Chernykh, Sergey Sevast'janov

Publication date: 16 October 2024

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

schedulingdynamic programmingpolynomially solvable caserouting flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Routing open shop and flow shop scheduling problems
• The museum visitor routing problem
• The routing open-shop problem on a network: complexity and approximation
• A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
• Heuristic Solution Algorithm for Routing Flow Shop with Buffers and Ready Times
• Improved Approximation Algorithms for Routing Shop Scheduling
• The Complexity of Flowshop and Jobshop Scheduling
• Routing Two-Machine Flowshop Problems on Networks with Special Structure
• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems

This page was built for publication: An exact solution with an improved running time for the routing flow shop problem with two machines