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
- 55 Downloads
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.
KeywordsSchedule Problem Remote Control Completion Time Optimal Schedule Single Machine
Unable to display preview. Download preview PDF.
- 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.Baptiste, Ph., Scheduling Equal-Length Jobs on Identical Parallel Machines, Discrete Appl. Math., 2000, no. 103, pp. 21–32.Google Scholar
- 3.Smith, W.E., Various Optimizers for Single-stage Production, Naval Res. Logistics Quart., 1956, no. 3, pp. 59–66.Google Scholar