A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper presents a genetic algorithm for an important production scheduling problem. Since the problem is NP-hard, we focus on suboptimal scheduling solutions for the hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints, and limited buffers. The production environment of a television assembly line for inserting electronic components is considered. The proposed genetic algorithm is a modified and extended version of the algorithm for a problemdoi:10.1016/j.cie.2008.09.004 fatcat:coqjvwln4ja23oumxhh5pminp4