Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines
- 21 November 2022
- book chapter
- Published by Springer Nature
- p. 324-335
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rulesNetworks, 2014
- A survey on offline scheduling with rejectionJournal of Scheduling, 2012
- Restoring infrastructure systems: An integrated network design and scheduling (INDS) problemEuropean Journal of Operational Research, 2012
- The flowtime network construction problemIIE Transactions, 2012
- Budgeted matching and budgeted matroid intersection via the gasoline puzzleMathematical Programming, 2009
- A Polynomial Time Approximation Scheme for the Multiple Knapsack ProblemSIAM Journal on Computing, 2005
- Multiprocessor Scheduling with RejectionSIAM Journal on Discrete Mathematics, 2000
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem1999
- The constrained minimum spanning tree problem1996
- Approximation Schemes for the Restricted Shortest Path ProblemMathematics of Operations Research, 1992