Industrial job-shop scheduling with random operations and different priorities

Abstract A classical job-shop scheduling problem with n jobs (orders) and m machines is considered. Each job-operation Oil (the l− th operation of job i, l = 1,…,m, i = 1, 2,…,n) has a random time duration til with the average value t il and the variance Vil. Each job Ji has its due date Di and its priority index ϱi. Given p i ∗ , the desired probability for job Ji to be accomplished on time, and p i ∗ ∗ , the least permissible probability for the job to meet its due date on time, the problem is to determine starting time values Sil for each job-operation Oil. Those values are not calculated beforehand and are values conditioned on our decisions. Decision-making, i.e., determining values Sil is carried out at the moments when at least one of the machines is free for service and at least one job is ready to be processed on that machine. If at a certain moment t more than one job is ready to be processed, these jobs are compared pairwise. The winner of the first pair will be compared with the third job, etc., until only one job will be left. The latter has to be chosen for the machine. The competition is carried out by calculating the job's delivery performance, i.e., the probability for a certain job to meet its due date on time. Such a calculation is carried out by determining the probability to meet the deadline for the chain of random operations. Two different heuristics for choosing a job from the line will be imbedded in the problem. The first one is based on examining delivery performance values together with priority indices ϱi. The second one deals with examining confidence possibilities p i ∗ and p i ∗ ∗ and does not take into account priority indices. A numerical example is presented. Both heuristics are examined via extensive simulation in order to evaluate their comparative efficiency for practical industrial problems.

[1]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[2]  T. B. Tate,et al.  Machine Scheduling Problems , 1978 .

[3]  Gideon Weiss,et al.  Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling , 1992, Math. Oper. Res..

[4]  Hal Mather.  How to really manage inventories , 1984 .

[5]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[6]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[7]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[8]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

[9]  Michael Pinedo,et al.  The "Largest Variance First" Policy in Some Stochastic Scheduling Problems , 1987, Oper. Res..

[10]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  R. Weber.  Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime , 1982, Journal of Applied Probability.

[13]  Gideon Weiss,et al.  On the optimal order of M machines in tandem , 1990 .

[14]  Hal Mather,et al.  MRP II won't schedule the factory of the future , 1986 .

[15]  Michael Pinedo,et al.  Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..

[16]  Steven A. Melnyk,et al.  Assessing the transient impact of lot sizing rules following MRP implementation , 1984 .

[17]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[18]  K. Glazebrook.  Scheduling tasks with exponential service times on parallel processors , 1979 .

[19]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

[20]  D. Sculli.  Priority dispatching rules in an assembly shop , 1987 .

[21]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[22]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[23]  Michael Pinedo,et al.  Scheduling of stochastic tasks on two parallel processors , 1979 .

[24]  William S. Gere.  Heuristics in Job Shop Scheduling , 1966 .

[25]  J. Walrand,et al.  Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime , 1986, Journal of Applied Probability.

[26]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[27]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[28]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[29]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[30]  Adam Janiak,et al.  Job-shop scheduling with resource-time models of operations , 1987 .

[31]  John R. King,et al.  Production Scheduling , 1988, Computer-Aided Production Management.

[32]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[33]  Lawrence M. Wein,et al.  A broader view of the job-shop scheduling problem , 1992 .

[34]  A. S. Spachis,et al.  Job-shop scheduling heuristics with local neighbourhood search , 1979 .