Abstract
We consider a scheduling problem involving a single processor being utilized by two or more customers. Traditionally, such scenarios are modeled by assuming that each customer has the same criterion. In practice, this assumption may not hold. Instead of using a single criterion, we examine the implications of minimizing an aggregate scheduling objective function in which jobs belonging to different customers are evaluated based on their individual criteria. We examine three basic scheduling criteria: minimizing makespan, minimizing maximum lateness, and minimizing total weighted completion time. Although determining a minimum-cost schedule according to any one of these criteria is polynomially solvable, we demonstrate that when minimizing a mix of these criteria, the problem becomes NP-hard.
Similar content being viewed by others
REFERENCES
Agnetis A., P. B. Mirchandani, D. Pacciarelli, and A. Pacifici, “Nondominated schedules for a job-shop with two competing users,” Comput. Math. Organ. Theory, 6, 191-217 (2000).
Agnetis A., P. B. Mirchandani, D. Pacciarelli, and A. Pacifici, “Scheduling problems with two competing users,” Università di Roma “Tor Vergata,” Centro Vito Volterra, Working Paper No. 452 (2001).
Baker K. R. and H. L. W. Nuttle, “Sequencing independent jobs with a single resource,” Naval Res. Logist. Quart., 27, 499-510 (1980).
Bruno J. L., E. G. Coffman, and R. Sethi, “Scheduling independent tasks to reduce mean finishing time,” Commun. ACM, 17, 382-387 (1974).
Conway R. W., W. L. Maxwell, and L. W. Miller, Theory of Scheduling, Addison-Welsey, Reading, MA (1967).
Garey M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA (1979).
Hoogeveen H., Personal communication (2002).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baker, K.R., Cole Smith, J. A Multiple-Criterion Model for Machine Scheduling. Journal of Scheduling 6, 7–16 (2003). https://doi.org/10.1023/A:1022231419049
Issue Date:
DOI: https://doi.org/10.1023/A:1022231419049