Abstract
Today’s importance of on time deliveries according to JIT concept makes managers to consider a desired set of extra ‘due date related’ criteria in the workshop scheduling. These criteria can be stated as tardiness, number of tardy jobs, and earliness. In this paper we focus on the bi-criteria scheduling problem of minimizing the number of tardy jobs and maximum earliness for single machine, in which the idle time is not allowed. The problem is known to be NP-hard. For this problem we developed a genetic algorithm by exploiting its general structure that further improves the initial population, utilizing a heuristic algorithm on the initial population. We present a computational experiment that shows the performance of the developed GA.
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.
