Skip to main content
Log in

Optimizing schedules in the pipeline systems with variable job execution order

  • Queueing Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The problem of speed-optimal solution was formulated for the pipeline systems with variable job execution order which depends on the number of the system stage, the order of job execution, and the finite time of its variation. The mathematical system model was constructed. The solution based on reducing the problem to a finite number of similar problems with constant job execution orders was proposed. Reduction algorithms and examples of designing the optimal variable job order were presented.

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

Access this article

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

  1. Johnson, S.M., Optimal Two-and Three-stage Production Schedules with Set-up Times Included, Nav. Res. Log. Quart., 1954, vol. 1, no.1, pp. 61–68.

    Google Scholar 

  2. Tanaev, V.S. and Shkurba, V.V., Vvedenie v teoriyu raspisanii (Introduction to the Scheduling Theory), Moscow: Nauka, 1975.

    Google Scholar 

  3. Conway, R.H., Maxwell, W.L., and Miller, L.V., Theory of Scheduling, New York: Addison-Wesley, 1967. Translated under the title Teoriya raspisanii, Moscow: Nauka, 1975.

    Google Scholar 

  4. Computer and Job-Shop Scheduling Theory, New York: Wiley, 1976. Translated under the title Teoriya raspisanii i vychislitel’nye mashiny, Coffman, E.G., Jr., Ed., Moscow: Nauka, 1984.

  5. Levin, V.I., Strukturno-logicheskie metody issledovaniya slozhnykh sistem (Structural and Logical Methods of Studying Complex Systems), Moscow: Nauka, 1987.

    Google Scholar 

  6. Tanaev, V.S., Sotskov, Yu.N., and Strusevich, V.A., Teoriya raspisanii. Mnogostadiinye sistemy (Scheduling Theory. Multistage Systems), Moscow: Nauka, 1989.

    Google Scholar 

  7. Levin, V.I. and Miretskii, I.Yu., Optimal Job Planning in Pipeline Systems, Avtom. Telemekh., 1996, no. 6, pp. 3–30.

  8. Shakhlevich, N.V., Sotskov, Y.N., and Werner, F., Complexity of Mixed Shop Scheduling Problems: A Survey, Prepr. Otto von Guericke—Universitat, Magdeburg, 1997, no. 43.

  9. Miretskii, I.Yu., Optimization of the Sequential Operating Systems, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2001, no. 6, pp. 70–76.

  10. Miretskii, I.Yu., Design of Suboptimal Schedules for Sequential Systems, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2002, no. 1, pp. 77–85.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Avtomatika i Telemekhanika, No. 3, 2005, pp. 74–90.

Original Russian Text Copyright © 2005 by Levin.

This paper was recommended for publication by V.M. Vishnevskii, a member of the Editorial Board

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levin, V.I. Optimizing schedules in the pipeline systems with variable job execution order. Autom Remote Control 66, 406–421 (2005). https://doi.org/10.1007/s10513-005-0070-9

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10513-005-0070-9

Keywords

Navigation