A combination of flow shop scheduling and the shortest path problem
From MaRDI portal
Publication:2354293
DOI10.1007/s10878-013-9670-4zbMath1328.90129arXiv1309.0081MaRDI 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
90C35: Programming involving graphs or networks
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Optimal path selection approach for fuzzy reliable shortest path problem, Vertex cover meets scheduling, A study on several combination problems of classic shop scheduling and shortest path, Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families, On the approximability of the two-phase knapsack problem, Improved approximation algorithms for the combination problem of parallel machine scheduling and path, Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms
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
