Industrial job-shop scheduling with random operations and different priorities

Dimitri Golenko-Ginzburg, Shmuel Kesler, Zinoviy Landsman

Research output: Contribution to journalArticlepeer-review


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 ρ{variant}i. Given pi*, the desired probability for job Ji to be accomplished on time, and pi**, 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 ρ{variant}i. The second one deals with examining confidence possibilities pi* and pi** 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.

Original languageEnglish
Pages (from-to)185-195
Number of pages11
JournalInternational Journal of Production Economics
Issue number2-3
StatePublished - Aug 1995


  • Job-shop problem
  • Pairwise comparison
  • Priority rule
  • Stochastic scheduling

ASJC Scopus subject areas

  • General Business, Management and Accounting
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Industrial job-shop scheduling with random operations and different priorities'. Together they form a unique fingerprint.

Cite this