A combination of flow shop scheduling and the shortest path problem

DOI10.1007/s10878-013-9670-4zbMath1328.90129arXiv1309.0081OpenAlexW2160962818MaRDI QIDQ2354293

Fabrice Talla Nobibon, Kameng Nip, Roel Leus, Zhen-bo Wang

Publication date: 10 July 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.0081

zbMATH Keywords

shortest pathapproximation algorithmflow shop schedulingcombination of optimization problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

Optimal path selection approach for fuzzy reliable shortest path problem ⋮ Vertex cover meets scheduling ⋮ Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families ⋮ 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 ⋮ Improved approximation algorithms for the combination problem of parallel machine scheduling and path

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Combination of parallel machine scheduling and vertex cover
• Approximability of flow shop scheduling
• Scheduling with incompatible jobs
• Robust discrete optimization and its applications
• Optimal two- and three-stage production schedules with setup times included
• Approximating Min-Max (Regret) Versions of Some Polynomial Problems
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• A New Heuristic for Three-Machine Flow Shop Scheduling

This page was built for publication: A combination of flow shop scheduling and the shortest path problem