论文信息 - Hierarchical Minimization of Total Completion Time and Number of Tardy Jobs Criteria

Hierarchical Minimization of Total Completion Time and Number of Tardy Jobs Criteria

2 Abstract: In this study, the single machine bicriteria scheduling problem of hierarchically minimizing the total completion time of jobs (C ) and number of tardy jobs (NT) with release time was explored. Two types of tot hierarchical minimization models (the case of the total completion time criterion being more important than the number of tardy jobs criterion and the case of the number of tardy jobs criterion being more important than the total completion time criterion) were discussed. Three heuristics (HR4, HR5 and HR6) selected from the literature were used to test the models.

Elkanah Oyetunji | A. E. Oluleye

[1] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .

[2] A. Nagar,et al. Multiple and bicriteria scheduling : A literature survey , 1995 .

[3] J. A. Hoogeveen,et al. Single-machine bicriteria scheduling , 1992 .

[4] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[5] Appa Iyer Sivakumar,et al. Hierarchical minimization of completion time variance and makespan in jobshops , 2006, Comput. Oper. Res..

[6] Han Hoogeveen,et al. Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[7] Serpil Sayin,et al. A bicriteria approach to the two-machine flow shop scheduling problem , 1999, Eur. J. Oper. Res..

[8] Elkanah Oyetunji,et al. Evaluating Solution Methods to Bicriteria Scheduling Problems , 2009 .

[9] Xavier Gandibleux,et al. An Annotated Bibliography of Multiobjective Combinatorial Optimization , 2000 .

[10] Clifford Stein,et al. On the existence of schedules that are near-optimal for both makespan and total weighted completion time , 1997, Oper. Res. Lett..

[11] Eric Torng,et al. New directions in machine scheduling , 2000 .

[12] Stéphane Dauzère-Pérès,et al. Minimizing late jobs in the general one machine scheduling problem , 1995 .