Makespan minimization on identical parallel machines subject to minimum total flow-time

Journal of the Chinese Institute of Industrial Engineers

Volumn 21, Issue 3, 2004, Pages 220-229

  Gupta, Jatinder N D ^a   Ho, Johnny C ^b   Ruiz Torres, Alex J ^c  

^a UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

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

^c POLYTECHNIC UNIVERSITY OF PUERTO RICO   (Puerto Rico)

Author keywords

Empirical results; Flowtime; Heuristic algorithms; Hierarchical criteria; Makespan; Parallel machine scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING;

EMPIRICAL RESULTS; FLOWTIME; HEURISTIC ALGORITHMS; HIERARCHICAL CRITERIA; MAKESPAN; PARALLEL MACHINE SCHEDULING;

MACHINE COMPONENTS;

EID: 24644440017     PISSN: 10170669     EISSN: 21517606     Source Type: Journal    
DOI: 10.1080/10170660409509403     Document Type: Article

References (8)

1. Bruno, J. L., Coffman, E. G., and Sethi, R., 1974. Algorithms for minimizing mean flow time. IFIPS Congress, 74:504–510.
2. Coffman, E. G., and Sethi, R., 1976. Algorithms minimizing mean flow time:schedule length properties. Acta Informatica, 6:1–14.
3. Coffman, E. G., Garey, M. R., and Johnson, D. S., 1978. An application of bib-packing to multi-processor scheduling. SIAM Journal on Computing, 7:1–17.
4. Conway, R. W., Maxwell, W. L., and Miller, L. W., 1976. Theory of scheduling MA:Addison Wesley.
5. Eck, B. T., and Pinedo, M., 1993. On the minimization of the makespan subject to flowtime optimality. Operations Research, 41:797–801.
6. Gupta, J. N. D., and Ho, J. C., 2001. Two machines hierarchical scheduling with makespan and flowtime criteria. Computers and Operations Research, 28:705–717.
7. Gupta, J. N. D., and Ruiz-Torres, A. J., 2000. Minimizing makespan subject to minimum total flow-time on identical parallel machines. European Journal of Operational Research, 125:370–380.
8. Leung, J. Y-T., and Young, G. H., 1989. Minimizing schedule length subject to minimum flow time. SIAM Journal on Computing, 18:314–326.