Abstract
In this paper an innovative method of assigning due-dates for a single-machine shop employing the SPT dispatching rule is proposed. A heuristic approach to determining the optimal due-dates which minimize the average amount of missed due-dates is also suggested. The effectiveness of the method is evaluated by computer simulation of a hypothetical job shop having different processing characteristics and under various shop conditions. It is shown that despite its simplicity, the heuristic method is able to assign accurate due-dates. In fact, its performance under all tested conditions is no more than 15% worse than the corresponding optimal values, which can be determined only after extensive searching on a computer. As a result, the heuristic method provides a simple but effective means for assigning due-dates.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
