View in EDS

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

Saved in:
Bibliographic Details
Title: Due date assignment procedures with dynamically updated coefficients for multi-level assembly job shops.
Authors: Adam, Nabil R., Bertrand, J. Will M., Morehead, Diane C., Surkis, Julius
Source: European Journal of Operational Research. 7/23/1993, Vol. 68 Issue 2, p212-227. 16p. 3 Charts.
Subjects: Job shops, Assignment problems (Programming)
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... [ABSTRACT FROM AUTHOR]
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
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... [ABSTRACT FROM AUTHOR]
ISSN:03772217
DOI:10.1016/0377-2217(93)90304-6