论文信息 - A two machine bicriteria scheduling problem

A two machine bicriteria scheduling problem

Abstract In this paper we consider the bicriteria problem of scheduling n jobs on two parallel machines to minimize the primary criterion of maximum tardiness ( T max ) and the secondary criterion of number of tardy jobs (NT). Algorithms are developed to optimize each of these criteria. Some properties on which the T max algorithm is based are developed. Computational experience with the algorithms is also reported.

Subhash C. Sarin | R. Hariharan | S. Sarin | R. Hariharan

[1] רבקה פריאור. מקבלי דמי פגיעה, 1988 , 1990 .

[2] H. Emmons,et al. Scheduling on Parallel Machines to Minimize Two Criteria Related to Job Tardiness , 1977 .

[3] P Dileepan,et al. Bicriterion static scheduling research for a single machine , 1988 .

[4] David S. Johnson,et al. Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[5] אסתר טולידנו. מקבלי דמי אבטלה בשנת 1989 , 1990 .

[6] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[7] Rakesh K. Sarin,et al. Scheduling with multiple performance measures: the one-machine case , 1986 .

[8] Mario T. Tabucanon,et al. Bicriterion scheduling problem in a job shop with parallel processors , 1991 .

[9] W. Townsend. Note---Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution , 1977 .

[10] H. Emmons. One machine sequencing to minimize mean flow time with minimum number tardy , 1975 .

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

[12] R. L. Daniels,et al. Multiobjective flow-shop scheduling , 1990 .