Abstract
The problem of family and job scheduling in a flowline-based manufacturing cell is considered with the criterion of minimizing makespan, followed by the criterion of minimizing total flowtime, and finally with the bi-criteria of minimizing makespan and total flowtime. We reckon the presence of missing operations in the manufacturing cell and present the correct problem formulation for time-tabling. We then propose the Genetic Algorithm (GA) for part-family scheduling and then for job scheduling within part-families. The proposed algorithm is compared with the existing algorithm and results are reported.
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.
