Sequencing unreliable jobs on parallel machines

Journal of Scheduling

Volumn 12, Issue 1, 2009, Pages 45-54

  Agnetis, Alessandro ^a   Detti, Paolo ^a   Pranzo, Marco ^a   Sodhi, Manbir S ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b University of Rhode Island   (United States)

Author keywords

Approximation algorithms; Indexable problems; NP hardness; Polymatroids; Unsupervised manufacturing systems

Indexed keywords

APPROXIMATION RESULTS; AUTOMATED MANUFACTURING; COMPUTATIONAL RESULTS; INDEXABLE PROBLEMS; NP-HARD; NP-HARDNESS; PARALLEL MACHINES; POLYMATROIDS; PROCESSING UNITS; ROUND ROBINS; SEQUENCING PROBLEMS; SINGLE MACHINES; UNSUPERVISED MANUFACTURING SYSTEMS; UPPER BOUNDS;

HARDNESS; HEURISTIC METHODS;

APPROXIMATION ALGORITHMS;

EID: 60349088871     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-008-0076-6     Document Type: Article

References (11)

1. D. Bertsimas J. Niño-Mora 1996 Conservation laws, extended polymatroids and multi-armed bandit problems: a polyhedral approach to indexable systems Mathematics of Operations Research 21 257 306
2. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability-a guide to the theory of NP-completeness. New York: Freeman.
3. Edmonds, J. (1970). Submodular functions, matroids and certain polyhedra. In R. Guy (Ed.), Combinatorial structures and their applications (pp. 68-87). New York: Gordon and Breach.
4. J. C. Gittins 1979 Bandit processes and dynamic allocation indices Journal of the Royal Statistical Society 41 148 177
5. Hellerstein, J., & Stonebraker, M. (1993). Predicate migration: optimizing queries with expensive predicates. In Proceedings of the 1993 ACM SIGMOD international conference on management of data (pp. 267-276).
6. L. G. Mitten 1960 An analytic solution to the least cost testing sequence problem Journal of Industrial and Engineering 11 17
7. C. L. Monma J. B. Sidney 1979 Sequencing with series-parallel precedence constraints Mathematics of Operations Research 4 3 215 224
8. Pinedo, M. (2002). Scheduling theory, algorithms, and systems. New York: Prentice-Hall.
9. Srivastava, U., Munagala, K., & Widom, J. (2005). Operator placement for inNetwork stream query processing. In ACM symposium on principles of databases.
10. M. Queyranne 1993 Structure of a simple scheduling polyhedron Mathematical Programming 58 263 285
11. T. Ünlüyurt 2004 Sequential testing of complex systems: a review Discrete Applied Mathematics 142 189 205