Skip to main content
SpringerLink
Log in

Minimizing the Total Weighted Duration of Courses in a Single Machine Problem with Precedence Constraints

  • OPTIMIZATION, SYSTEM ANALYSIS, AND OPERATIONS RESEARCH
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

A single machine scheduling problem with a given partial order of jobs is considered. There are subsets of jobs called courses. It is necessary to schedule jobs in such a way that the total weighted duration of all courses is minimal. We consider the case when the initial job and the final one of each course are uniquely determined. The NP-hardness of the problem under consideration is proved. We propose an algorithm for solving the problem, the complexity of which depends polynomially on the total number of jobs, but exponentially on the number of courses, which makes it possible to use it efficiently with a fixed small number of courses and an arbitrary number of jobs.

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.

Institutional subscriptions

Fig. 1.
Fig. 2.

REFERENCES

  1. Brucker, P., Scheduling Algorithms, Springer: Heidelberg, 2007.

    Google Scholar 

  2. Lazarev, A.A., Teoriya raspisanii. Metody i algoritmy (Theory of Schedules. Methods and Algorithms), Moscow: ICS RAS, 2019.

  3. Lazarev, A., Khusnullin, N., Musatova, E., Yadrentsev, D., Kharlamov, M., and Ponomarev K., Minimization of the weighted total sparsity of cosmonaut training courses, OPTIMA 2018, Communications in Computer and Information Science, 2019, pp. 202–215.

  4. Harhalakis, G., Special features of precedence network charts, Eur. J. Oper. Res., 1990, vol. 49, no. 1, pp. 50–59.

    Article  Google Scholar 

  5. Cs’ebfalvi, A.B. and Cs’ebfalvi, G., Hammock activities in project scheduling, Proceedings of the Sixteenth Annual Conference of POMS, 2005.

  6. Eliezer, O., A new bi-objective hybrid metaheuristic algorithm for the resource-constrained hammock cost problem (RCHCP), Doctoral Dissertation, Pécs, 2011.

  7. El-Rayes, K. and Moselhi, O., Resource-driven scheduling of repetitive activities, Construction Management and Economics, 1998, vol. 16, no. 4, pp. 433–446.

    Article  Google Scholar 

  8. Vanhoucke, M., Work continuity constraints in project scheduling, Working Paper 04/265, Belgium: Ghent University, Faculty of Economics and Business Administration, 2004.

  9. Vanhoucke, M. and Van Osselaer, K., Work continuity in a real-life schedule: the Westerschelde Tunne, Working Paper 04/271, Belgium: Ghent University, Faculty of Economics and Business Administration, 2005.

  10. Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, 1979, vol. 5, pp. 287–326.

    Article  MathSciNet  Google Scholar 

  11. Lenstra, J.K. and Rinnooy Kan, A.H.G., Complexity of scheduling under precedence constraints, Oper. Res., 1978, vol. 26, no. 1, pp. 22–35.

    Article  MathSciNet  Google Scholar 

  12. Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, MIT Press, 2022.

    Google Scholar 

  13. IBM ILOG CPLEX Optimization Studio. https://www.ibm.com/products/ilog-cplex-optimization-studio.

  14. Potts, C.N., An algorithm for the single machine sequencing problem with precedence constraint, Combinatorial Optimization II. Mathematical Programming Studies, Springer: Berlin, Heidelberg, 1980, vol. 13, pp. 78–87.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    E. G. Musatova & A. A. Lazarev

Authors
  1. E. G. Musatova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Lazarev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to E. G. Musatova or A. A. Lazarev.

Additional information

This paper was recommended for publication by P.Yu. Chebotarev, a member of the Editorial Board

Publisher’s Note.

Pleiades Publishing 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

Musatova, E.G., Lazarev, A.A. Minimizing the Total Weighted Duration of Courses in a Single Machine Problem with Precedence Constraints. Autom Remote Control 84, 1005–1015 (2023). https://doi.org/10.1134/S0005117923090102

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117923090102

Keywords:

Search

Navigation