Minimizing makespan subject to minimum total flow-time on identical parallel machines

European Journal of Operational Research

Volumn 125, Issue 2, 2000, Pages 370-380

  Gupta, Jatinder N D ^a   Ruiz Torres, Alex J ^b  

^a BALL STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT EL PASO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; PROBLEM SOLVING; SCHEDULING;

FLOW TIME; HEURISTIC ALGORITHMS; PARALLEL-MACHINE SCHEDULING;

OPERATIONS RESEARCH;

EID: 0033704095     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00386-0     Document Type: Article

References (16)

1. Bernardo J.J., Lin K. An interactive procedure for bi-criteria production scheduling. Computers and Operations Research. 21(6):1994;677-688.
2. Bruno J.L., Coffman E.G., Sethi R. Algorithms for minimizing mean flow time. IFIPS Congress. 74:1974;504-510.
3. Chen C., Bulfin R.L. Complexity of single machine, multi-criteria scheduling problems. European Journal of Operational Research. 70:1993;115-125.
4. Coffman E.G., Garey M.R., Johnson D.S. An application of bin-packing to multi-processor scheduling. SIAM Journal of Computing. 7(1):1978;1-17.
5. Coffman E.G., Sethi R. Algorithms minimizing mean flow time: Schedule length properties. Acta Informatica. 6:1976;1-14.
6. Conway R.W., Maxwell W.L., Miller L.W. Theory of Scheduling. 1967;Addison-Wesley, Reading, MA.
7. Eck B.T., Pinedo M. On the minimization of the makespan subject to flowtime optimality. Operations Research. 41:1993;797-801.
8. Friesen D.K., Langston M.A. Evaluation of a MULTIFIT-based scheduling algorithm. Journal of Algorithms. 7:1986;35-59.
9. Graham R.L. Bounds on multiprocessor timing anomalies. SIAM Journal of Applied Mathematics. 17:1969;416-429.
10. J.N.D. Gupta, J.C. Ho, Two machines hierarchical scheduling with makespan and flowtime criteria, Computers and Operations Research (to appear).
11. S.K. Kedia, A job shop scheduling problem with parallel machines, Unpublished Report, Department of Industrial Engineering, University of Michigan, Ann Arbor, MI.
12. Lee C.Y., Massey J.D. Multiprocessor scheduling: Combining LPT and MULTIFIT. Discrete Applied Mathematics. 20:1988;233-242.
13. C.-Y. Lee, G.L. Vairaktarakis, Complexity of single machine hierarchical scheduling: A survey, in: P.M. Pardalos (Ed.), Complexity in Numerical Optimization, World Scientific, Singapore, pp. 269-298.
14. Nagar A., Haddock J., Heragu S. Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research. 81:1995;88-104.
15. A.J. Ruiz-Torres, E. Enscore, R.R. Barton, Parallel machine scheduling for minimizing the makespan and the average flow-time, in: Proceedings of the Institute of Industrial Engineers 1997 Research Conference, pp. 186-191.
16. Sheskin J.S. Handbook of Parametric and Nonparametric Statistical Procedures. 1997;CRC Press, London.