Abstract
We consider a scheduling problem in which two agents, each with a set of non-preemptive jobs, compete to perform their jobs on a common bounded parallel-batching machine. Each of the agents wants to minimize an objective function that depends on the completion times of its own jobs. The goal is to schedule the jobs such that the overall schedule performs well with respect to the objective functions of both agents. We focus on minimizing the makespan or the total completion time of one agent, subject to an upper bound on the makespan of the other agent. We distinguish two categories of batch processing according to the compatibility of the agents. In the case where the agents are incompatible, their jobs cannot be processed in the same batch, whereas all the jobs can be processed in the same batch when the agents are compatible. We show that the makespan problem can be solved in polynomial time for the incompatible case and is NP-hard in the ordinary sense for the compatible case. Furthermore, we show that the latter admits a fully polynomial-time approximation scheme. We prove that the total completion time problem is NP-hard and is polynomially solvable for the incompatible case with a fixed number of job types.
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. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229–242.
Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150, 3–15.
Baker, K. R., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7–16.
Baptiste, P. (2000). Batching identical jobs. Mathematical Methods of Operations Research, 52, 355–367.
Brucker, P. (2006). Scheduling algorithms (5th edn.). Berlin: Springer.
Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., & van de Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31–54.
Brucker, P., & Knust, S. (2011). Complexity results for scheduling problems. http://www.mathematik.uni-osnabrueck.de/research/OR/class
Chandru, V., Lee, C.-Y., & Uzsoy, R. (1993). Minimizing total completion time on batch processing machines. International Journal of Production Research, 31, 2097–2122.
Chandru, V., Lee, C.-Y., & Uzsoy, R. (1993). Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13, 61–65.
Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273–281.
Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2008). Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research, 188, 603–609.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman.
Hochbaum, D. S., & Landy, D. (1997). Scheduling semiconductor burn-in operations to minimize total flowtime. Operations Research, 45, 874–885.
Ibarra, O., & Kim, C. E. (1975). Fast approximation algorithms for the Knapsack and sum of subset problems. Journal of the ACM, 22, 463–468.
Lee, C.-Y., Uzsoy, R., & Martin-Vega, L. A. (1992). Efficient algorithms for scheduling semi-conductor burn-in operations. Operations Research, 40, 764–775.
Lee, C.-Y., & Uzsoy, R. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219–236.
Leung, J. Y.-T., Pinedo, M., & Wan, G. (2010). Competitive two-agent scheduling and its applications. Operations Research, 58, 458–469.
Li, S. S., & Yuan, J. J. (2011) Unbounded parallel-batching scheduling with two competitive agents. Journal of Scheduling. doi:10.1007/s10951-011-0253-x
Liu, L. L., Ng, C. T., & Cheng, T. C. E. (2010). On the complexity of bi-criteria scheduling on a single batch processing machine. Journal of Scheduling, 13, 629–638.
Liu, P., Zhou, X. Y., & Tang, L. X. (2010). Two-agent single-machine scheduling with position-dependent processing times. The International Journal of Advanced Manufacturing Technology, 48, 325–331.
Mathirajan, M., & Sivakumar, A. I. (2006). A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. The International Journal of Advanced Manufacturing Technology, 29, 990–1001.
Mor, B., & Mosheiov, G. (2010). Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. European Journal of Operational Research, 206, 540–546.
Mor, B., & Mosheiov, G. (2011). Single machine batch scheduling with two competing agents to minimize total flowtime. European Journal of Operational Research, 215, 524–531.
Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2006). A note on the complexity of the problem of two-agent scheduling on a single machine. Journal of Combinatorial Optimization, 12, 387–394.
Nong, Q. Q., Cheng, T. C. E., & Ng, C. T. (2011). Two-agent scheduling to minimize the total cost. European Journal of Operational Research, 215, 39–44.
Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228–249.
Wan, G., Vakati, S. R., Leung, J. Y.-T., & Pinedo, M. (2010). Scheduling two agents with controllable processing times. European Journal of Operational Research, 205, 528–539.
Woeginger, G. J. (2000). When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing, 12, 57–75.
Acknowledgements
We are grateful to the associate editor and two anonymous referees for their helpful comments on an earlier version of this paper. This research was supported by the National Natural Science Fund of China under grant numbers 11001117 and 60904080. Cheng and Fan were supported by The Hong Kong Polytechnic University under grant number G-U982. In addition, the first author was also supported by the Shandong Province Natural Science Foundation under grant number ZR2011AL016.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fan, B.Q., Cheng, T.C.E., Li, S.S. et al. Bounded parallel-batching scheduling with two competing agents. J Sched 16, 261–271 (2013). https://doi.org/10.1007/s10951-012-0274-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-012-0274-0