Header menu link for other important links
X
Minimizing maximum tardiness for unrelated parallel machines
Vakkalanka Gowri Suresh
Published in
1994
Volume: 34
   
Issue: 2
Pages: 223 - 229
Abstract
In this paper, the scheduling of n jobs, all requiring a single stage of processing, on m unrelated parallel machines is considered. The scheduling objective is to minimize the maximum tradiness. An algorithm is proposed for the above problem. Computational results are reported with data generated using various combinations of processing times and due dates. The results show that the proposed algorithm meets the expectations of any scheduling environment. © 1994.
About the journal
JournalInternational Journal of Production Economics
ISSN09255273
Open AccessNo
Concepts (9)
  •  related image
    Algorithms
  •  related image
    Job analysis
  •  related image
    Optimization
  •  related image
    Production control
  •  related image
    DUE DATES
  •  related image
    MAXIMUM TARDINESS MINIMIZATION
  •  related image
    PROCESSING TIMES
  •  related image
    UNRELATED PARALLEL MACHINES
  •  related image
    Scheduling