Skip to main content
Springer Nature Link
Log in

A just-in-time scheduling problem with two competing agents

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We consider a single-machine scheduling problem with two competing agents. The objective is to minimize the total weighted completion time of jobs of agent 1 with a constraint on the total weight of the just-in-time jobs of agent 2. Our problem can be categorized into the non-preemptive and the preemptive versions, depending on whether the preemption is allowed for jobs of agent 1. First, we show that some open cases of the first version are NP-hard. Then, we categorize the second version into several cases, depending on whether the processing times or the weights of each agent are identical. We analyze how the computational complexity is affected by the identical processing times or the identical weights of each agent.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Oper. Res. 52, 229–242 (2004)

    Article  MathSciNet  Google Scholar 

  2. Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Multi-agent single machine scheduling. Ann. Oper. Res. 150, 3–15 (2007)

    Article  MathSciNet  Google Scholar 

  3. Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., Soukhal, A.: Multiagent Scheduling-Models and Algorithms. Springer, Berlin (2014)

    Book  Google Scholar 

  4. Ahuja, R.A., Mehlhorn, K., Orlin, J.B.: Faster algorithm for the shortest path problem. J. Assoc. Comput. Mach. 37, 213–223 (1990)

    Article  MathSciNet  Google Scholar 

  5. Baker, K.R., Smith, J.C.: A multiple-criterion model for machine scheduling. J. Sched. 6, 7–16 (2003)

    Article  MathSciNet  Google Scholar 

  6. Cepek, R.L., Sung, S.C.: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Comput. Oper. Res. 32, 3265–3271 (2005)

    Article  MathSciNet  Google Scholar 

  7. Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor. Comput. Sci. 362, 273–281 (2006)

    Article  MathSciNet  Google Scholar 

  8. Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Multi-agent scheduling on a single machine with max-form criteria. Eur. J. Oper. Res. 188, 603–609 (2008)

    Article  MathSciNet  Google Scholar 

  9. Choi, B.C., Chung, J.: Two-agent single-machine scheduling problem with just-in-time jobs. Theor. Comput. Sci. 543, 37–45 (2014)

    Article  MathSciNet  Google Scholar 

  10. Choi, B.-C., Park, M.-J.: A batch scheduling problem with Two agents. Asia Pac. J. Oper. Res. 32, 1550044 (2015)

    Article  MathSciNet  Google Scholar 

  11. Choi, B.C., Yoon, S.H.: Maximizing the weighted number of just-in-time jobs in flow shop scheduling. J. Sched. 10, 237–243 (2007)

    Article  MathSciNet  Google Scholar 

  12. Chung, D.Y., Choi, B.C.: Just-in-time scheduling with competing agents. Korean Oper. Res. Manag. Sci. 37, 19–28 (2012)

    Google Scholar 

  13. Gerstl, E., Mosheiov, G.: Single machine just-in-time scheduling problems with two competing agents. Nav. Res. Logist. 61, 1–16 (2014)

    Article  MathSciNet  Google Scholar 

  14. Graham, R., Lawler, E.L., Lenstra, J., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)

    Article  MathSciNet  Google Scholar 

  15. Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17, 36–42 (1992)

    Article  MathSciNet  Google Scholar 

  16. Hiraishi, K., Levner, E., Vlach, M.: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Comput. Oper. Res. 29, 841–848 (2002)

    Article  MathSciNet  Google Scholar 

  17. Lawler, E.L.: Sequencing to minimize the weighted number of late jobs. RAIRO Rech. Oper. 10, 27–33 (1976)

    MATH  Google Scholar 

  18. Lee, K.B., Choi, B.C., Leung, J.Y.T., Pinedo, M.L.: Approximation algorithms for multi-agent scheduling to minimize total weight completion time. Inf. Process. Lett. 109, 913–917 (2009)

    Article  Google Scholar 

  19. Lann, A., Mosheiov, G.: Single machine scheduling to minimize the number of early and tardy jobs. Comput. Oper. Res. 23, 769–781 (1996)

    Article  Google Scholar 

  20. Leung, J.Y.T., Pinedo, M.L., Wan, G.: Competitive two-agent scheduling and its applications. Oper. Res. 58, 458–469 (2010)

    Article  MathSciNet  Google Scholar 

  21. Liua, P., Yib, N., Zhoua, X.: Two-agent single-machine scheduling problems under increasing linear deterioration. Appl. Math. Model. 35, 2290–2296 (2011)

    Article  MathSciNet  Google Scholar 

  22. Mor, B., Mosheiov, G.: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. Eur. J. Oper. Res. 206, 540–546 (2010)

    Article  MathSciNet  Google Scholar 

  23. Mor, B., Mosheiov, G.: Single machine batch scheduling with two competing agents to minimize total flowtime. Eur. J. Oper. Res. 215, 524–531 (2011)

    Article  MathSciNet  Google Scholar 

  24. Nong, Q.Q., Cheng, T.C.E., Ng, C.T.: Two-agent scheduling to minimize the total cost. Eur. J. Oper. Res. 215, 39–44 (2011)

    Article  MathSciNet  Google Scholar 

  25. Sung, S.C., Vlach, M.: Maximizing weighted number of just-in-time jobs on unrelated parallel machines. J. Sched. 8, 453–460 (2005)

    Article  MathSciNet  Google Scholar 

  26. Wu, C.-C., Huang, S.-K., Lee, W.-C.: Two-agent scheduling with learning consideration. Comput. Ind. Eng. 61, 1324–1335 (2011)

    Article  Google Scholar 

  27. Wu, C.-C., Lee, W.-C., Liou, M.-J.: Single-machine scheduling with two competing agents and learning consideration. Inf. Sci. 251, 136–149 (2013)

    Article  MathSciNet  Google Scholar 

  28. Wang, Z., Wei, C.-M., Wu, Y.-B.: Single machine two-agent scheduling with deteriorating jobs. Asia Pac. J. Oper. Res. 33, 1650034 (2016)

    Article  MathSciNet  Google Scholar 

  29. Yin, Y., Cheng, S.-R., Cheng, T.-C.-E., Wu, W.-H., Wu, C.-C.: Two-agent single-machine scheduling with assignable due dates. Appl. Math. Comput. 219, 1674–1685 (2012)

    MathSciNet  MATH  Google Scholar 

  30. Yin, Y., Cheng, S.-R., Wu, C.-C.: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Inf. Sci. 189, 282–292 (2012)

    Article  MathSciNet  Google Scholar 

  31. Yin, Y., Cheng, S.-R., Cheng, T.C.E., Wang, D.-J., Wu, C.-C.: Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega 63, 41–47 (2016)

    Article  Google Scholar 

  32. Yin, Y., Cheng, T.-C.-E., Long, W., Wu, C.-C., Jun, L.: Two-agent single-machine scheduling with deteriorating jobs. Comput. Ind. Eng. 81, 177–185 (2015)

    Article  Google Scholar 

  33. Yin, Y., Cheng, T.C.E., Wang, D.-J., Wu, C.-C.: Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. J. Sched. 20, 313–335 (2017)

    Article  MathSciNet  Google Scholar 

  34. Yin, Y., Cheng, T.C.E., Yang, X., Wu, C.-C.: Two-agent single-machine scheduling with unrestricted due date assignment. Comput. Ind. Eng. 79, 148–155 (2015)

    Article  Google Scholar 

  35. Yin, Y., Wang, Y., Cheng, T.C.E., Wang, D.-J., Wu, C.-C.: Two-agent single-machine scheduling to minimize the batch delivery cost. Comput. Ind. Eng. 92, 16–30 (2016)

    Article  Google Scholar 

  36. Yin, Y., Wang, D.-J., Wu, C.-C., Cheng, T.C.E.: CON/SLK due date assignment and scheduling on a single machine with two agents. Nav. Res. Logist. 63, 416–429 (2016)

    Article  MathSciNet  Google Scholar 

  37. Yuan, J.J., Shang, W.P., Feng, Q.: A note on the scheduling with two families of jobs. J. Sched. 8, 537–542 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by the Ministry of Education of the Republic of Korea and the National Research Foundation of Korea (NRF-2018S1A5B8070344).

Author information

Authors and Affiliations

  1. Department of Business Administration, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon, 34134, Korea

    Byung-Cheon Choi

  2. Department of Industrial Channels Management, Kongju National University, 54 Daehak-ro, Yesan-eup, Yesan-gun, Chungcheongnam-do, 32439, Korea

    Jibok Chung

  3. Department of Industrial and Management Systems Engineering, Kyung Hee University, 1732, Deogyeong-daero, Giheung-gu, Yongin-si, Kyunggi-do, 17104, Korea

    Myoung-Ju Park

Authors
  1. Byung-Cheon Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jibok Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Myoung-Ju Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Myoung-Ju Park.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Choi, BC., Chung, J. & Park, MJ. A just-in-time scheduling problem with two competing agents. Optim Lett 14, 1869–1886 (2020). https://doi.org/10.1007/s11590-019-01494-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-019-01494-x

Keywords