Abstract
Abstract This study investigats a new approach‐the sequential approach‐ in job shop scheduling. The objective is to minimize the total of lateness cost and set‐up cost in job shops. Whenever a scheduling decision has to be made as to which job should receive the next processing, this approach considers each cost sequentially. One of the two costs is considered first, and every time all waiting jobs must be examined in terms of this cost, and only those jobs qualified would the second cost apply to and from which a job would be selected for processing. This investigation was carried out by using GASP IV simulation under a variety of job shop situations. The effectiveness of this approach and job selection mechanism constitute the main theme of this study.
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.
