Abstract
We consider the problem of scheduling two jobs A and B on a set of m uniform parallel machines. Each job is assumed to be independent from the other: job A and job B are made up of n A and n B operations, respectively. Each operation is defined by its processing time and possibly additional data such as a due date, a weight, etc., and must be processed on a single machine. All machines are uniform, i.e. each machine has its own processing speed. Notice that we consider the special case of equal-size operations, i.e. all operations have the same processing time. The scheduling of operations of job A must be achieved to minimize a general cost function F A, whereas it is the makespan that must be minimized when scheduling the operations of job B. These kind of problems are called multiple agent scheduling problems. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for F A and \(C_{\mathrm{max}}^{B}\) criteria. In this paper we consider different min-max and min-sum versions of function F A and provide special properties as well as polynomial time algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agnetis, A., Mirchandani, P., Pacciarelli, D., & Pacifici, A. (2000). Nondominated schedules for a job-shop with two competing users. Computational & Mathematical Organization Theory, 6(2), 191–217.
Agnetis, A., Mirchandani, P., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 42(2), 229–242.
Baker, K., & Smith, J. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7–16.
Balasubramanian, H., Fowler, J., Keha, A., & Pfund, M. (2009). Scheduling interfering job sets on parallel machines. European Journal of Operational Research, 199(1), 55–67. doi:10.1016/j.ejor.2008.10.038.
Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2, 245–252.
Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103(1–3), 21–32. doi:10.1016/S0166-218X(99)00238-3.
Baptiste, P. (2003). A note on scheduling multiprocessor tasks with identical processing times. Computers and Operations Research, 30(13), 2071–2078.
Baptiste, P., & Brucker, P. (2004). Scheduling equal processing time jobs. In J. Y. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis. London/ Boca Raton: Chapman & Hall / CRC Press.
Baptiste, P., Chrobak, M., Dürr, C., & Sourd, F. (2004). Preemptive multi-machine scheduling of equal-length jobs to minimize the average flow time. arXiv:cs/0412094.
Brucker, P., & Kravchenko, S. (2008). Scheduling jobs with equal processing times and time windows on identical parallel machines. Journal of Scheduling, 11, 229–237.
Cheng, T., Ng, C., & Yuan, J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273–281.
Chrobak, M., Durr, C., Jawor, W., Kowalik, L., & Kurowski, M. (2006). A note on scheduling equal-length jobs to maximize throughput. Journal of Scheduling, 9, 71–73.
Dessouky, M. I., Lageweg, B. J., Lenstra, J. K., & van de Velde, S. L. (1990). Scheduling identical jobs on uniform parallel machines. Statistica Neerlandica, 44(3), 115–123.
Ehrgott, M. (2005). Multicriteria optimization (2nd ed.). Berlin: Springer.
Graham, R. L., EL, Lawler, Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287–326.
Huynh Tuong, N., & Soukhal, A. (2009). Interfering job set scheduling on two-operation three-machine flowshop. In IEEE—RIVF international conference on computing and communication technologies (RIVF’09), Da Nang, Vietnam.
Huynh Tuong, N., Soukhal, A., & Billaut, J. C. (2009). New scheduling problems with interfering and independent jobs, 33 p. Paper submitted to Journal of Scheduling the 8 September 2009.
Lawler, E. L. (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19(5), 544–546. doi:10.1287/mnsc.19.5.544.
Leung, J. Y. T., Pinedo, M., & Wan, G. (2010). Competitive Two-Agent Scheduling and Its Applications. Operations Research, 58(2), 458–469. doi:10.1287/opre.1090.0744.
Ng, C., Cheng, T., & Yuan, J. (2006). A note on the complexity of the problem of two-agent scheduling on a single machine. Journal of Combinatorial Optimization, 12(4), 387–394. doi:10.1007/s10878-006-9001-0.
T’kindt, V., & Billaut, J. C. (2006). Multicriteria scheduling: theory, models and algorithms (2nd ed.). Berlin: Springer.
Tuzikov, A., Makhaniok, M., & Männer, R. (1998). Bicriterion scheduling of identical processing time jobs by uniform processors. Computers and Operations Research, 25(1), 31–35.
Yuan, J., Shang, W., & Feng, Q. (2005). A note on the scheduling with two families of jobs. Journal of Scheduling, 8, 537–542.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Elvikis, D., Hamacher, H.W. & T’kindt, V. Scheduling two agents on uniform parallel machines with makespan and cost functions. J Sched 14, 471–481 (2011). https://doi.org/10.1007/s10951-010-0201-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-010-0201-1