Advertisement

Automation and Remote Control

, Volume 71, Issue 10, pp 2085–2092 | Cite as

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

  • A. A. Lazarev
  • A. G. Kvaratskhelia
Scheduling Problems on a Single Machine
  • 55 Downloads

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.

Keywords

Schedule Problem Remote Control Completion Time Optimal Schedule Single Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    Baptiste, Ph., Scheduling Equal-Length Jobs on Identical Parallel Machines, Discrete Appl. Math., 2000, no. 103, pp. 21–32.Google Scholar
  3. 3.
    Smith, W.E., Various Optimizers for Single-stage Production, Naval Res. Logistics Quart., 1956, no. 3, pp. 59–66.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2010

Authors and Affiliations

  • A. A. Lazarev
    • 1
  • A. G. Kvaratskhelia
    • 1
  1. 1.Trapeznikov Institute of Control SciencesRussian Academy of SciencesMoscowRussia

Personalised recommendations