Due date assignment procedures with dynamically updated coefficients for multi-level assembly job shops

N.R. Adam, J.W.M. Bertrand, D.C. Morehead, J. Surkis

Research output: Contribution to journalArticleAcademicpeer-review

45 Citations (Scopus)
224 Downloads (Pure)


This paper presents a study of due date assignment procedures in job shop environments where multi-level assembly jobs are processed and due dates are internally assigned. Most of the reported studies in the literature have focused on string type jobs. We propose a dynamic update approach (which makes use of Little's Law) to obtain the coefficients used in the traditional due date assignment procedures of constant allowance (CON), total work content (TWK) and critical path processing time (CPPT). The coefficient assigned to a given job reflects both the state of the shop at the time the job is processed and the characteristics of the job. The approach also provides the shop management with the ability to control the average job lateness. In the simulation experiments conducted in this study, we set the average lateness at zero. The analysis of simulation results shows that the proposed dynamic procedures provide overall better shop performance than their static counterparts, especially for less complex assembly job structures. A procedure for determining job due dates that extends the critical path concept of the CPPT procedure to critical path flow time (CPFT) is also proposed. Unlike the others, this procedure does not need the determination of any coefficients. The procedure uses estimates of waiting times at work centers that are determined dynamically based on shop work load information. In this paper, an adaptive adjustment approach is also suggested to bring average lateness for the CPFT procedure to a target value. Results of the simulation experiments show that the CPFT combined with the adaptive adjustment approach (CPFT-ADJ) provides overall improved performance compared to the dynamic and static versions of the CON, TWK, and CPPT procedures for less complex job structures. For more complex assembly job structures and string jobs the CPFT-ADJ procedure results in comparable performance to the dynamic versions of the CON, TWK, and CPPT procedures. The paper also provides an investigation of the interaction between the two priority rules: earliest job due date (JDD) and the earliest operation due date (OPNDD) and the four due date procedures: CON, TWK, CPPT, and CPFT-ADJ. In general, for multi-level assembly job structures JDD outperforms OPNDD in terms of average job lead time and tardiness.
Original languageEnglish
Pages (from-to)212-227
Number of pages16
JournalEuropean Journal of Operational Research
Issue number2
Publication statusPublished - 1993


Dive into the research topics of 'Due date assignment procedures with dynamically updated coefficients for multi-level assembly job shops'. Together they form a unique fingerprint.

Cite this