Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems

DOI10.1007/978-3-642-38768-5_60zbMath1382.90038OpenAlexW2262565820MaRDI QIDQ4925283

Kameng Nip, Zhen-bo 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

shortest pathapproximation algorithmcombination of optimization problemstwo-machine flow shop scheduling

Mathematics Subject Classification ID

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

Related Items (4)

Vertex cover meets scheduling ⋮ 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 ⋮ On the approximability of the two-phase knapsack problem

This page was built for publication: Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems