Improved approximation algorithms for the combination problem of parallel machine scheduling and path

DOI10.1007/s10878-019-00406-0zbMath1430.90485OpenAlexW2924612178MaRDI QIDQ2331579

Weidong Li, Junran Lichen, Li Guan, Jianping Li

Publication date: 29 October 2019

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

Full work available at URL: https://doi.org/10.1007/s10878-019-00406-0

zbMATH Keywords

shortest pathapproximation algorithmparallel machine schedulingpolynomial time approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

Joint chance constrained shortest path problem with Copula theory

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A study on several combination problems of classic shop scheduling and shortest path
• Combination of parallel machine scheduling and vertex cover
• Approximation schemes for scheduling on parallel machines
• On the optimality of exact and approximation algorithms for scheduling problems
• An improved FPTAS for Restricted Shortest Path.
• A combination of flow shop scheduling and the shortest path problem
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Approximation Schemes for the Restricted Shortest Path Problem
• An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Improved approximation algorithms for the combination problem of parallel machine scheduling and path