Scheduling parallel dedicated machines with the speeding-up resource

Naval Research Logistics

Volumn 55, Issue 5, 2008, Pages 377-389

  Kellerer, Hans ^a   Strusevich, Vitaly A ^b  

^a UNIVERSITY OF GRAZ   (Austria)

^b UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Approximation; Complexity; Parallel dedicated machines; Resource constraints; Scheduling

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING; NUCLEAR PROPULSION; OPTIMIZATION; SCHEDULING; SYSTEMS ENGINEERING;

APPROXIMATION; ARBITRARY NUMBERS; COMPLEXITY; DYNAMIC PROGRAMMING ALGORITHMS; FIXED NUMBERS; KNAPSACK PROBLEMS; MAKESPAN; NP-HARD; PARALLEL DEDICATED MACHINES; PARALLEL MACHINES; PROCESSING TIME; RESOURCE CONSTRAINTS; SCHEDULING JOBS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 49149120190     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20292     Document Type: Article

References (16)

1. J. Błażewicz, N. Brauner, and G. Finke, "Scheduling with discrete resource constraints," J.Y.-T. Leung (Editor), Handbook of scheduling: Algorithms, models and performance analysis, Chapman & Hall/CRC, London, 2004, pp. 23-1-23-18.
2. J. Błażewicz, K.H. Ecker, G. Schmidt, and J. Weglarz, Scheduling in computer and manufacturing systems, Springer, Berlin, 1994.
3. J. Błażewicz, J.K. Lenstra, and A.H.G. Rinnooy Kan, Scheduling subject to resource constraints, Discrete Appl Math 5 (1983), 11-24.
4. T. Erlebach, H. Kellerer, and U. Pferschy, Approximating multi-objective knapsack problems, Management Sci 48 (2002), 1603-1612.
5. A. Grigoriev, H. Kellerer, and V.A. Strusevich, Dedicated parallel machine scheduling with a single speeding-up resource, 6th Workshop on models and algorithms for planning and scheduling problems, book of abstracts, 2003, pp. 131-132.
6. A. Grigoriev, M. Sviridenko, and M. Uetz, Machine scheduling with resource dependent processing times, Math Program 110 (2007), 209-228.
7. A. Grigoriev and M. Uetz, "Scheduling parallel jobs with linear speedup," T. Erlebach and P. Persiano (Editors), Approximation and online algorithms (WAOA 2005), Lecture Notes Cornput Sci 3879 (2006), 203-215.
8. O.H. Ibarra and C.E. Kim, Fast approximation algorithms for the knapsack and sum of subsets problem, J ACM 22 (1975), 463-468.
9. A. Janiak and M. Y. Kovalyov, Single machine scheduling subject to deadlines and resource dependent processing times, Eur J Oper Res 94 (1996), 284-291.
10. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack problems, Springer, Berlin, 2004.
11. H. Kellerer and V. A. Strusevich, Scheduling parallel dedicated machines under a single non-shared resource, Eur J Oper Res 147 (2003), 345-364.
12. H. Kellerer and V. A. Strusevich, Scheduling problems for parallel dedicated machines under multiple resource constraints, Discrete Appl Math 113 (2004), 45-68.
13. E. Nowicki and S. Zdrzalka, A survey of results for sequencing problems with controllable processing times, Discrete Appl Math 26 (1990), 271-287.
14. C.N. Papadimitriou and M. Yannakakis, On the approximability of trade-offs and optimal access web sources, Proc 41st Symp Foundations of Computer Science, 2000, pp. 86-92.
15. D. Shabtay, Single and a two-resource allocation algorithms for minimizing the maximal lateness in a single machine-scheduling problem, Comput Oper Res 31 (2004), 1303-1315.
16. D. Shabtay and M. Kaspi, Parallel machine scheduling with a convex resource consumption function, Eur J Oper Res 173 (2006), 92-107.