Optimal due-date assignment in a job shop†

1 May 1986

journal article
research article
Published by Taylor & Francis in International Journal of Production Research

Vol. 24 (3) , 503-515
https://doi.org/10.1080/00207548608919746

Abstract

This paper presents an analytical model for determining the optimal processing-time and number of operations multiples for the TWK and TWK + NOP due-date assignment methods in a dynamic job shop subject to restrictive assumptions on queue discipline and processing time distribution. The analytical results are compared with the experimental results obtained from simulation of a hypothetical job shop under various shop conditions. The close agreement of the results reveals the validity of the analytical model. In addition, the results show that the TWK + NOP method is more effective in minimizing the missed due-date cost in a job shop.

Keywords

This publication has 6 references indexed in Scilit:

Analysis of Job Flow-Time in a Job Shop
Journal of the Operational Research Society, 1985
Due Date Assignment for Production Systems
Management Science, 1981
A Simulation Study of Predictable Due-Dates
Management Science, 1979
A Methodology for Assigning Minimum Cost Due-Dates
Management Science, 1977
Due dates in job shop scheduling
International Journal of Production Research, 1976
Jobshop-Like Queueing Systems
Management Science, 1963