Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

Just-in-time Scheduling with Multiple Competing Agents

다수의 경쟁이 존재하는 환경에서 적시 스케줄링에 관한 연구

  • Received : 2011.08.16
  • Accepted : 2011.11.17
  • Published : 2012.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

We consider a multi-agent scheduling problem such that each agent tries to maximize the weighted number of just-in-time jobs. Two objectives are considered : the first is to find the optimal solution for one agent with constraints on the other agents' weight functions, and the second is to find the largest set of efficient schedules of which corresponding objective vectors are different for the case with identical weights. We show that when the number of agents is fixed, the single machine case with the first objective is NP-hard in the ordinary sense, and present the polynomial- time algorithm for the two-machine flow shop case with the second objective and identical weights.

Keywords

References

  1. Agnetis, A., P.B. Mirchandani, D. Pacciarelli, and A. Pacifici, "Scheduling problems with two competing agents," Operations Research, Vol.52, No.2(2004), pp.229-242. https://doi.org/10.1287/opre.1030.0092
  2. Agnetis, A., P.B. Mirchandani, D. Pacciarelli, and A. Pacifici, "Multi-agent single machie sheduling," Annal of Operations Research, Vol.150(2007), pp.3-15. https://doi.org/10.1007/s10479-006-0164-y
  3. Ahuja, R.A., K. Mehlhorn, J.B. Orlin, and R.E. Tarjan, "Faster algorithms for the shortest path problem," Journal of the Association for Computing Machinery, Vol.37(1990), pp.213-223. https://doi.org/10.1145/77600.77615
  4. Arbib, C., S. Smriglio, and M. Servilio, "A competitive scheduling problem and its relevances to UMTS channel assignment," Networks, Vol.44, No.2(2004), pp.132-141. https://doi.org/10.1002/net.20023
  5. Cepek, R.L. and S.C. Sung, "A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines," Computers and Operations Research, Vol.32(2005), pp.3265-3271. https://doi.org/10.1016/j.cor.2004.05.011
  6. Cheng, T.C.E., C.T. Ng, and J.J. Yuan, "Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs," Theoretical Computer Science, Vol.362(2006), pp.273-281. https://doi.org/10.1016/j.tcs.2006.07.011
  7. Choi, B.C. and S.H. Yoon, "Maximizing the weighted number of just-in-time jobs in flow shop scheduling," Journal of Scheduling, Vol.10(2007), pp.237-243. https://doi.org/10.1007/s10951-007-0030-z
  8. Cormen, T.H. and C.E. Leiserson, "Introduction to algorithm, Cambridge : MIT press, 1996.
  9. Hall, N.G. and C.N. Potts, "Rescheduling for New Orders," Operations Research, Vol.52(2004), pp.440-453. https://doi.org/10.1287/opre.1030.0101
  10. Hiraishi, K., E. Levner, and M. Vlach, "Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs," Computers and Operations Research, Vol.29(2002), pp.841-848. https://doi.org/10.1016/S0305-0548(00)00086-1
  11. Lann, A. and G. Mosheiov, "Single machine scheduling to minimize the number of early and tardy jobs," Computers and Operations Research, Vol.23(1996), pp.769-781. https://doi.org/10.1016/0305-0548(95)00078-X
  12. Lee, K.B., B.C. Choi, J.Y.T. Leung, and M.L. Pinedo, "Approximation algorithms for multiagent scheduling to minimize total weight completion time," Information Processing Letters, Vol.109(2009), pp.913-917. https://doi.org/10.1016/j.ipl.2009.04.018
  13. Lee, W.C., S.K. Chen, C.W. Chen, and C.C. Wu, "A two-machine flowshop problem with two agents," Computers and Operations Research, Vol.109(2009), pp.913-917.
  14. Leung, J.Y.T., M.L. Pinedo, and G. Wan, "Competitive two-agent scheduling and its applications," Operations Research, Vol.58(2010), pp.458-469. https://doi.org/10.1287/opre.1090.0744
  15. Ng, C.T., T.C.E. Cheng, and J.J. Yuan, "A note on the complexity of the problem of two-agent scheduling on a single machine," Journal of Combinatorial Optimization, Vol.12(2006), pp.387-394. https://doi.org/10.1007/s10878-006-9001-0
  16. Sung, S.C. and M. Vlach, "Maximizing weighted number of just-in-time jobs on unrelated parallel machines," Journal of Scheduling, Vol.8(2005), pp.453-460. https://doi.org/10.1007/s10951-005-2863-7

Cited by

  1. Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs vol.20, pp.4, 2017, https://doi.org/10.1007/s10951-017-0511-7