Skip to main content
Springer Nature Link
Log in

Scheduling two projects with controllable processing times in a single-machine environment

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We consider two single-machine scheduling problems in which two competing projects share one common resource. Each project has multiple interim assessments, and its own jobs are ordered completely. A tardy job incurs a tardiness penalty cost which can be avoided by compressing some jobs, which requires an additional cost. The performance measure of each project is the total tardiness penalty cost plus the total compression cost. The first problem minimizes the weighted sum of the performance measures of two projects, and the second problem minimizes the performance measure of one project with a constraint on that of the other. We show that the first problem is solvable in strongly polynomial time and the second is weakly NP-hard. Furthermore, we analyze how the computational complexity of each problem changes if the number of projects is more than two.

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Agnetis, A., Billaut, J. C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling: Models and algorithms. Berlin: Springer.

    Book  Google Scholar 

  • Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229–242.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms and applications.,New Jersy: Prentice Hall.

    Google Scholar 

  • Arbib, C., Smriglio, S., & Servilio, M. (2004). A competitive scheduling problem and its relevance to UMTS channel assignment. Networks, 44, 132–141.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Cheng, T. C. E., Chen, Z.-L., & Li, C.-L. (1996). Single-machine scheduling with trade-off between number of tardy jobs and resource allocation. Operations Research Letters, 19, 237–242.

    Article  Google Scholar 

  • Cheng, T. C. E., Chen, Z.-L., Li, C.-L., & Lin, B. M.-T. (1998). Scheduling to minimize the total compression and late costs. Naval Research Logistics, 45, 67–82.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Choi, B. C., & Chung, J. B. (2014). Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. European Journal of Operational Research, 236, 61–68.

    Article  Google Scholar 

  • Choi, B. C., & Park, M. J. (2015). A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs. European Journal of Operational Research, 244, 748–752.

    Article  Google Scholar 

  • Falk, J. E., & Horowitz, J. L. (1972). Critical path problems with concave cost-time curves. Management Science, 19, 446–455.

    Article  Google Scholar 

  • Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. New Jersy: Princeton University Press.

    Google Scholar 

  • Fulkerson, D. R. (1961). A network flow computation for project cost curves. Management Science, 7, 167–178.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman.

    Google Scholar 

  • Gerstl, E., & Mosheiov, G. (2014). Single machine just-in-time scheduling problems with two competing agents. Naval Research Logistics, 61, 1–16.

    Article  Google Scholar 

  • Hall, N. G., & Potts, C. N. (2004). Rescheduling for new orders. Operations Research, 52, 440–453.

    Article  Google Scholar 

  • Hassin, R. (1992). Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 517, 36–42.

    Article  Google Scholar 

  • He, Y., Wei, Q., & Cheng, T. C. E. (2007). Single-machine scheduling with trade-off between number of tardy jobs and compression cost. Journal of Scheduling, 10, 303–310.

    Article  Google Scholar 

  • Kelley, J. E. (1961). Critical path planning and scheduling: Mathematical basis. Operations Research, 9, 296–320.

    Article  Google Scholar 

  • Lee, K. B., Choi, B. C., Leung, J. Y. T., & Pinedo, M. L. (2009). Approximation algorithms for multi-agent scheduling to minimize total weight completion time. Information Processing Letters, 109, 913–917.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Mor, B., & Mosheiov, G. (2017). A two-agent single machine scheduling problem with due-window assignment and a common flowallowance. Journal of Combinatorial Optimization, 33, 1454–1468.

    Article  Google Scholar 

  • Perez-Gonzalez, P., & Framinan, J. M. (2014). A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems. European Journal of Operational Research, 235, 1–16.

    Article  Google Scholar 

  • Roemer, T. A., & Ahmadi, R. (2004). Concurrent crashing and overlapping in product development. Operations Research, 52, 606–622.

    Article  Google Scholar 

  • Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155, 1643–1666.

    Article  Google Scholar 

  • Tseng, C.-T., Lia, C.-J., & Huang, K.-L. (2009). Minimizing total tardiness on a single machine with controllable processing times. Computers and Operations Research, 36, 1643–1666.

    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, 528–539.

    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 

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

    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 and Industrial Engineering, 92, 16–30.

    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, 63, 416–429.

    Article  Google Scholar 

  • Yin, Y., Yang, Y., Wang, D., Cheng, T. C. E., & Wu, C.-C. (2018). Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Naval Research Logistics, 65, 393–409.

    Article  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. School of Business, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon, 34134, Korea

    Byung-Cheon Choi

  2. 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. 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., Park, MJ. Scheduling two projects with controllable processing times in a single-machine environment. J Sched 23, 619–628 (2020). https://doi.org/10.1007/s10951-020-00658-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-020-00658-3

Keywords