Skip to main content
SpringerLink
Log in

Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives

  • RAOTA-2016
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider a single-machine scheduling problem with two-agents, each with a set of non-pre-emptive jobs, where two agents compete for the use of a single processing resource. A switchover time arises whenever a job of one agent is processed after a job of another agent. Each agent wants to minimize a certain objective function, which depends upon the completion time and switchover time of their own jobs only. This paper considers the minimization of total weighted completion time of the first agent subject to an upper bound on the makespan of the second agent. We introduce some properties to the problem. The properties describe the structure of an optimal solution which is being used for developing an optimal algorithm. We propose an optimal algorithm, a simple heuristic algorithm, and a particle-swarm-based meta heuristic algorithm to solve the problem. The heuristic algorithm is based on the weighted shortest process time-first rule. The performances of the heuristic and particle swarm algorithms are evaluated on randomly generated problem instances. We perform the numerical analysis to reveal the properties of the proposed problem.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

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(2), 229–242.

    Article  Google Scholar 

  • Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150(1), 3–15.

    Article  Google Scholar 

  • Agnetis, A., Pascale, G., & Pacciarelli, D. (2009). A Lagrangian approach to single-machine scheduling problems with two competing agents. Journal of Scheduling, 12(4), 401–415.

    Article  Google Scholar 

  • Ahmadov, Y., & Helo, P. (2016). A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing. Annals of Operations Research. doi:10.1007/s10479-016-2304-3.

  • Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985–1032.

    Article  Google Scholar 

  • Baker, K. R., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6(1), 7–16.

    Article  Google Scholar 

  • Cheng, T. C. E., Cheng, S.-R., Wu, W.-H., Hsu, P.-H., & Wu, C.-C. (2011). A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Computers & Industrial Engineering, 60(4), 534–541.

    Article  Google Scholar 

  • Dover, O., & Shabtay, D. (2016). Single machine scheduling with two competing agents, arbitrary release dates and unit processing times. Annals of Operations Research, 238(1–2), 145–178.

    Article  Google Scholar 

  • Elvikis, D., & T’kindt, V. (2014). Two-agent scheduling on uniform parallel machines with min–max criteria. Annals of Operations Research, 213(1), 79–94.

    Article  Google Scholar 

  • Gajpal, Y., & Sahu, S. N. (2014a). A pseudo polynomial time algorithm for a single machine scheduling problem under competition to minimize total weighted completion time and makespan objectives. In Paper proceedings of the 11th international conference on computational management science (CMS), Lisbon, Portugal, May 29–31, 2014.

  • Gajpal, Y., Sahu, S. N., & Dua, A. (2014b). Heuristics for single machine scheduling under competition to minimize total weighted completion time and makespan objectives. In Paper proceedings of the 6th international conference on applied operational research (ICAOR), Vancouver, BC, Canada, July, 29–31.

  • Gawiejnowicz, S., Lee, W.-C., Lin, C.-L., & Wu, C.-C. (2011). Single-machine scheduling of proportionally deteriorating jobs by two agents. Journal of the Operational Research Society, 62(11), 1983–1991.

    Article  Google Scholar 

  • Gerstl, E., & Mosheiov, G. (2013). Scheduling problems with two competing agents to minimize weighted earliness–tardiness. Computers & Operations Research, 40(1), 109–116.

    Article  Google Scholar 

  • Grobler, J., Engelbrecht, A. P., Kok, S., & Yadavalli, S. (2010). Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time. Annals of Operations Research, 180(1), 165–196.

    Article  Google Scholar 

  • Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. In Proceedings of IEEE international conference on neural networks, Vol. 4. Washington, DC: Bureau of Labor Statistics, pp. 1942–1948.

  • Lee, W.-C., Cheng, S.-K., Chen, C.-W., & Wu, C.-C. (2011). A two-machine flow shop problem with two agents. Computers & Operations Research, 38(1), 98–104.

    Article  Google Scholar 

  • Leung, J. Y.-T., Pinedo, M., & Wan, G. (2010). Competitive two-agent scheduling and its applications. Operations Research, 58(2), 458–469.

    Article  Google Scholar 

  • Li, D.-C., & Hsu, P.-H. (2012). Solving a two-agent single-machine scheduling problem considering learning effect. Computers and Operations Research, 39(7), 1644–1651.

    Article  Google Scholar 

  • Li, S., & Yuan, J. (2012). Unbounded parallel-batching scheduling with two competitive agents. Journal of Scheduling, 15(5), 629–640.

    Article  Google Scholar 

  • Liao, C. J., Tseng, C. T., & Luarn, P. (2007). A discrete version of particle swarm optimization for flowshop scheduling problems. Computers & Operations Research, 34(10), 3099–3111.

    Article  Google Scholar 

  • Liu, P., Tang, L., & Zhou, X. (2010a). Two-agent group scheduling with deteriorating jobs on a single machine. The International Journal of Advanced Manufacturing Technology, 47(5–8), 657–664.

    Article  Google Scholar 

  • Liu, P., Zhou, X., & Tang, L. (2010b). Two-agent single-machine scheduling with position-dependent processing times. The International Journal of Advanced Manufacturing Technology, 48(1–4), 325–331.

    Article  Google Scholar 

  • Mor, B., & Mosheiov, G. (2010). Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. European Journal of Operational Research, 206(3), 540–546.

    Article  Google Scholar 

  • Mor, M., & Mosheiov, G. (2011). Single machine batch scheduling with two competing agents to minimize total flowtime. European Journal of Operational Research, 215(3), 524–531.

    Article  Google Scholar 

  • Mor, M., & Mosheiov, G. (2014). Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. Journal of the Operational Research Society, 65(1), 151–157.

    Article  Google Scholar 

  • Pei, J., Liu, X., Pardalos, P. M., Fan, W., & Yang, S. (2017). Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Annals of Operations Research, 249(1), 175–195.

  • Tasgetiren, M. F., Sevkli, M., Liang, Y. C., & Gencyilmaz, G. (2004). Particle swarm optimization algorithm for permutation flowshop sequencing problem. In Proceedings of the fourth international workshop on ant colony optimization and swarm intelligence (ANTS2004). Lecture notes in computer science, Brussels, Belgium, Vol. 3172, 2004. pp. 382–90.

  • Tasgetiren, M. F., Liang, Y. C., Sevkli, M., & Gencyilmaz, G. (2007). A particle swarm optimization for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research, 177(3), 1930–1947.

    Article  Google Scholar 

  • 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(3), 528–539.

    Article  Google Scholar 

  • Wang, D. J., Yin, Y., Xu, J., Wu, W. H., Cheng, S. R., & Wu, C. C. (2015). Some due date determination scheduling problems with two agents on a single machine. International Journal of Production Economics, 168, 81–90.

    Article  Google Scholar 

  • Wang, D. J., Yin, Y., Cheng, S. R., Cheng, T. C. E., & Wu, C. C. (2016). Due date assignment and scheduling on a single machine with two competing agents. International Journal of Production Research, 54(4), 1152–1169.

    Article  Google Scholar 

  • Wang, D. J., Kang, C. C., Shiau, Y. R., Wu, C. C., & Hsu, P. H. (2017). A two-agent single-machine scheduling problem with late work criteria. Soft Computing, 21(8), 2015–2033.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Yin, Y., Wu, W.-H., Cheng, S.-R., & Wu, C.-C. (2012b). An investigation on a two-agent single-machine scheduling problem with unequal release dates. Computers and Operations Research, 39(12), 3062–3073.

    Article  Google Scholar 

  • Yin, Y., Cheng, S.-R., Cheng, T. C. E., Wu, W.-H., & Wu, C.-C. (2013). Two-agent single-machine scheduling with release times and deadlines. International Journal of Shipping and Transport Logistics, 5(1), 75–94.

    Article  Google Scholar 

  • Yin, Y., Wang, D. J., Wu, C. C., & Cheng, T. C. E. (2016). CON/SLK due date assignment and scheduling on a single machine with two agents. Naval Research Logistics (NRL), 63(5), 416–429.

    Article  Google Scholar 

  • Yin, Y., Wang, Y., Cheng, T. C. E., Wang, D. J., & Wu, C. C. (2016). Two-agent single-machine scheduling to minimize the batch delivery cost. Computers & Industrial Engineering, 92, 16–30.

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

This research is partially supported by University Start-up Research Grant from Asper School of Business. The authors are thankful to the anonymous reviewers for their comments which helped us to improve the paper.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, National Institute of Technology, Agartala, Agartala, Tripura, 799046, India

    Shesh Narayan Sahu & Swapan Debbarma

  2. Asper School of Business, University of Manitoba, Winnipeg, MB, R3T5V4, Canada

    Yuvraj Gajpal

Authors
  1. Shesh Narayan Sahu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuvraj Gajpal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Swapan Debbarma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuvraj Gajpal.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sahu, S.N., Gajpal, Y. & Debbarma, S. Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives. Ann Oper Res 269, 623–640 (2018). https://doi.org/10.1007/s10479-017-2515-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-017-2515-2

Keywords

Search

Navigation