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

Nabil Adam, J. Will M. Bertrand, Diane C. Morehead, Julius Surkis

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

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 (US)
Pages (from-to)212-227
Number of pages16
JournalEuropean Journal of Operational Research
Volume68
Issue number2
DOIs
StatePublished - Jul 23 1993

Fingerprint

Due Date Assignment
Job Shop
Critical Path
Due Dates
Flow Time
Coefficient
Processing
Simulation Experiment
Experiments
Job shop
Due date assignment
Coefficients
Adjustment
Strings
Critical path
Priority Rules
Tardiness
Waiting Time
Workload

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Keywords

  • Due date assignment procedures
  • Job shop scheduling
  • Lead time allowance
  • Multilevel job shops

Cite this

Adam, Nabil ; Bertrand, J. Will M. ; Morehead, Diane C. ; Surkis, Julius. / Due date assignment procedures with dynamically updated coefficients for multi-level assembly job shops. In: European Journal of Operational Research. 1993 ; Vol. 68, No. 2. pp. 212-227.
@article{2a51c322cd56413eb2b7960069912c82,
title = "Due date assignment procedures with dynamically updated coefficients for multi-level assembly job shops",
abstract = "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.",
keywords = "Due date assignment procedures, Job shop scheduling, Lead time allowance, Multilevel job shops",
author = "Nabil Adam and Bertrand, {J. Will M.} and Morehead, {Diane C.} and Julius Surkis",
year = "1993",
month = "7",
day = "23",
doi = "10.1016/0377-2217(93)90304-6",
language = "English (US)",
volume = "68",
pages = "212--227",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

Due date assignment procedures with dynamically updated coefficients for multi-level assembly job shops. / Adam, Nabil; Bertrand, J. Will M.; Morehead, Diane C.; Surkis, Julius.

In: European Journal of Operational Research, Vol. 68, No. 2, 23.07.1993, p. 212-227.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Adam, Nabil

AU - Bertrand, J. Will M.

AU - Morehead, Diane C.

AU - Surkis, Julius

PY - 1993/7/23

Y1 - 1993/7/23

N2 - 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.

AB - 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.

KW - Due date assignment procedures

KW - Job shop scheduling

KW - Lead time allowance

KW - Multilevel job shops

UR - http://www.scopus.com/inward/record.url?scp=0027627910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027627910&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(93)90304-6

DO - 10.1016/0377-2217(93)90304-6

M3 - Article

AN - SCOPUS:0027627910

VL - 68

SP - 212

EP - 227

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -