Hans Kellerer
- 1.R.H. Ahmadi and U. Bagchi, "Lower bounds for singlemachine scheduling problems", Naval Res. Logist. 37, 967- 979 (1990).Google Scholar
Cross Ref
- 2.K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.Google Scholar
- 3.L. Bianco and S. Ricciardelli, "Scheduling of a single machine to minimize total weighted completion time subject to release dates", Naval Res. Logist. 29, 151--167 (1982).Google ScholarCross Ref
- 4.R. Chandra, "On n{l{F dynamic deterministic problems", Naval Res. Logist. 26, 537-544 (1979).Google ScholarCross Ref
- 5.C. Chu, "Efficient heuristics to minimize total flow time with release dates", Oper. Res. Left. 12, 321-330 (1992).Google ScholarDigital Library
- 6.C. Chu, "A branch-and-bound algorithm to minimize total flow time with unequal release dates", Naval Res. Logist. 39, 859-875 (1992).Google ScholarCross Ref
- 7.J.S. Deogun, "On scheduling with ready times to minimize mean flow time", Comput. J. 26,320-328 (1983).Google ScholarCross Ref
- 8.M.I. Dessouky and J.S. Deogun, "Sequencing jobs with unequal ready times to minimize mean flow time", SlAM J, Comput. 10, 192-202 (1981).Google ScholarCross Ref
- 9.J. Du, J.Y.T. Leung and G.H. Young, "Minimizing mean flow time with release time constraint", Theoretical Computer Science YS, :347-355 (1990). Google ScholarDigital Library
- 10.M.E. Dyer and L.A. Wolsey, "Formulating the single macJxine sequencing problem with release dates as a mixed integer program", Discr. Appl. Math. 26, 255-270 (1990). Google ScholarDigital Library
- 11.M.R. Garey and D.S. Johnson, Computers and Intractability, Freeman and Company, San Francisco, 1070.Google Scholar
- 12.P.G. Gazmuri, "Probabilistic analysis of a machine scheduling problem", Math. Oper. Res. 10, 328-339 (1985).Google ScholarDigital Library
- 13.A.M.A. Hariri and C.N. Potts, "An algorithm for single machine sequencing with release times to minimize total weighted completion time", Discr. Appl. Math. 5, 99-109 (1983).Google ScholarCross Ref
- 14.J. Labetoulle, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, "Preemptive scheduling of uniform machines subject to release dates", Progress in Combinatorial Optimization, Academic Press, New York, 245-261 (1984).Google Scholar
- 15.J.K. Lenstra, A.H.G. Riunooy Karl and P. Brucker, "Complexity of machine scheduling problems", Ann. Discrete Math. 1,343-362 (1977).Google ScholarCross Ref
- 16.W. Mao and A. Rifkin, "Analysis of the FCFS algorithm for 11r~ I ~ 6'3", unpublished manuscript.Google Scholar
- 17.M.E. Posner, "Minimizing weighted completion times with deadlines", Oper. Research 33, 562-574 (1985).Google ScholarDigital Library
- 18.W.E. Smith, "Various optimizers for single-state production'', Naval Res. Lo&ist. Quart. 3, 56-66 (1956).Google ScholarCross Ref
Index Terms
- Approximability and nonapproximability results for minimizing total flow time on a single machine
Recommendations
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total flow time. This problem is well known to be NP-complete, and the best polynomial-time approximation algorithms constructed so far ...
Single machine common flow allowance scheduling with a rate-modifying activity
In this paper we consider single machine SLK due date assignment scheduling problem with a rate-modifying activity. In this model, the machine has a rate-modifying activity that can change the processing rate of machine under consideration. Hence the ...
Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
We consider a single machine scheduling problem with simple linear deterioration. Job processing times are assumed to be a simple linear function of a job-dependent growth rate and the job's starting time. We seek an optimal schedule, so as to minimize ...
Comments