Scheduling with Sequencing Flexibility

This study examines the effects of sequencing flexibility on the performance of rules used to schedule operations in manufacturing systems. The findings show that taking advantage of even low levels of sequencing flexibility in the set of operations required to do a job results in substantial improvement in the performance of scheduling rules with respect to mean flowtime. Differences in the mean flowtime measure for various rules also diminish significantly with increasing sequencing flexibility. Performance improvements additionally result for such due-date related performance measures as mean tardiness and the proportion of jobs tardy. At high levels of sequencing flexibility, some nonparametric scheduling rules outperform the shortest processing time rule in terms of the mean flowtime criterion. Rules based on job due dates also outperform rules based on operation milestones in terms of tardiness related criteria at high levels of sequencing flexibility. The implications of these findings for the design of manufacturing systems and product design are noted.

[1]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .

[2]  Suresh P. Sethi,et al.  Flexibility in manufacturing: A survey , 1990 .

[3]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[4]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[5]  Jack C. Hayya,et al.  Priority dispatching with operation due dates in a job shop , 1982 .

[6]  Percy H. Brill,et al.  On measures of flexibility in manufacturing systems , 1989 .

[7]  Randall P. Sadowski,et al.  Introduction to Simulation Using Siman , 1990 .

[8]  F. J. Russo.  A HEURISTIC APPROACH TO ALTERNATE ROUTING IN A JOB SHOP , 1965 .

[9]  Thomas J. Schriber,et al.  An introduction to simulation using GPSS/H , 1991 .

[10]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[11]  Jwm Will Bertrand,et al.  A dynamic priority rule for scheduling against due-dates , 1982 .

[12]  Thomas J. Schriber.  Modeling perfect sequencing flexibility when "fewest remaining steps" is used as the dispatching rule , 1994 .

[13]  Gabriel R. Bitran,et al.  A simulation model for job shop scheduling , 1983 .

[14]  James J. Solberg,et al.  Effectiveness of flexible routing control , 1991 .

[15]  Thomas J. Schriber.  The modeling of perfect sequencing flexibility in a scheduling environment , 1991, 1991 Winter Simulation Conference Proceedings..

[16]  Donald Gerwin,et al.  An agenda for research on the flexibility of manufacturing processes , 1987 .

[17]  Kenneth R. Baker,et al.  Job shop scheduling with modified due dates , 1983 .

[18]  Ram Rachamadugu,et al.  Performance of dispatching rules under perfect sequencing flexibility , 1990, 1990 Winter Simulation Conference Proceedings.

[19]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[20]  Eric R. Zieyel.  Operations research : applications and algorithms , 1988 .