Abstract
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. This problem is known to be open. Here, we give some properties of optimal schedules for the problem and its special cases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Graham, R.L., Lawler, E.L., Lenstra, J.K., et. al., Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Ann. Discrete Math., 1979, no. 5, pp. 287–326.
Baptiste, Ph., Scheduling Equal-Length Jobs on Identical Parallel Machines, Discrete Appl. Math., 2000, no. 103, pp. 21–32.
Smith, W.E., Various Optimizers for Single-stage Production, Naval Res. Logistics Quart., 1956, no. 3, pp. 59–66.
Author information
Authors and Affiliations
Additional information
Original Russian Text © A.A. Lazarev, A.G. Kvaratskhelia, 2010, published in Avtomatika i Telemekhanika, 2010, No. 10, pp. 80–89.
This work was supported by the program of Presidium of the Russian Academy of Sciences no. 29 “The Mathematical Theory of Control.”
Rights and permissions
About this article
Cite this article
Lazarev, A.A., Kvaratskhelia, A.G. Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. Autom Remote Control 71, 2085–2092 (2010). https://doi.org/10.1134/S0005117910100073
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117910100073