Combination of two-machine flow shop scheduling and shortest path problems

DOI10.1007/978-3-642-38768-5_60MaRDI QIDQ4925283zbMATH OpenOpenAlexFDO

Authors Kameng Nip, Zhenbo Wang

Publication date 11 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38768-5_60

zbMATH Keywords

approximation algorithmcombination of optimization problemsshortest pathtwo-machine flow shop scheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A combination of flow shop scheduling and the shortest path problem
• A study on several combination problems of classic shop scheduling and shortest path
• Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms
• Improved approximation algorithms for the combination problem of parallel machine scheduling and path
• Routing Two-Machine Flowshop Problems on Networks with Special Structure

Cited in

(7)

• Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
• On the approximability of the two-phase knapsack problem
• Improved approximation algorithms for the combination problem of parallel machine scheduling and path
• A combination of flow shop scheduling and the shortest path problem
• Vertex cover meets scheduling
• Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms
• A study on several combination problems of classic shop scheduling and shortest path

This page was built for publication: Combination of two-machine flow shop scheduling and shortest path problems

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