Abstract
This paper addresses an allocation and sequencing problem motivated by an application in unsupervised automated manufacturing. There are n independent jobs to be processed by one of m machines or units during a finite unsupervised duration or shift. Each job is characterized by a certain success probability p i , and a reward r i which is obtained if the job is successfully carried out. When a job fails during processing, the processing unit is blocked, and the jobs subsequently scheduled on that machine are blocked until the end of the unsupervised period. The problem is to assign and sequence the jobs on the machines so that the expected total reward is maximized. This paper presents the following results for this problem and some extensions: (i) a polyhedral characterization for the single machine case, (ii) the proof that the problem is NP-hard even with 2 machines, (iii) approximation results for a round-robin heuristic, (iv) an effective upper bound. Extensive computational results show the effectiveness of the heuristic and the bound on a large sample of instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bertsimas, D., & Niño-Mora, J. (1996). Conservation laws, extended polymatroids and multi-armed bandit problems: a polyhedral approach to indexable systems. Mathematics of Operations Research, 21, 257–306.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability—a guide to the theory of NP-completeness. New York: Freeman.
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.
Gittins, J. C. (1979). Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society, 41, 148–177.
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).
Mitten, L. G. (1960). An analytic solution to the least cost testing sequence problem. Journal of Industrial and Engineering, 11, 17.
Monma, C. L., & Sidney, J. B. (1979). Sequencing with series-parallel precedence constraints. Mathematics of Operations Research, 4(3), 215–224.
Pinedo, M. (2002). Scheduling theory, algorithms, and systems. New York: Prentice-Hall.
Srivastava, U., Munagala, K., & Widom, J. (2005). Operator placement for inNetwork stream query processing. In ACM symposium on principles of databases.
Queyranne, M. (1993). Structure of a simple scheduling polyhedron. Mathematical Programming, 58, 263–285.
Ünlüyurt, T. (2004). Sequential testing of complex systems: a review. Discrete Applied Mathematics, 142, 189–205.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Agnetis, A., Detti, P., Pranzo, M. et al. Sequencing unreliable jobs on parallel machines. J Sched 12, 45–54 (2009). https://doi.org/10.1007/s10951-008-0076-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-008-0076-6