MAKESPAN MINIMIZATION ON IDENTICAL PARALLEL MACHINES SUBJECT TO MINIMUM TOTAL FLOW-TIME

We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule to the proposed problem is defined as one that gives the smallest makespan (the completion time of the last job on any one of the parallel machines) among the set of all schedules with optimal total fl...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Chinese Institute of Industrial Engineers Vol. 21; no. 3; pp. 220 - 229
Main Authors Gupta, Jatinder N. D., Ho, Johnny C., Ruiz-Torres, Alex J.
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.01.2004
Subjects
empirical results
flowtime
heuristic algorithms
hierarchical criteria
makespan
Parallel machine scheduling
Online AccessGet full text
ISSN1017-0669
2151-7606
DOI10.1080/10170660409509403

Cover

More Information
Summary:We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule to the proposed problem is defined as one that gives the smallest makespan (the completion time of the last job on any one of the parallel machines) among the set of all schedules with optimal total flowtime (the sum of the completion times of all jobs). We propose two new simple heuristic algorithms and empirically compare their effectiveness and efficiency with several existing algorithms.
ISSN:1017-0669
2151-7606
DOI:10.1080/10170660409509403