Abstract
Traditional research in scheduling has concentrated on developing optimal and optional tending heuristic algorithms for n x m job shop and flow shop problems. Relatively no work has been conducted in the area of scheduling within a GT cell. This paper examines the GT cell environment from a scheduling perspective in relation to a job and flow shop, and presents a modified approach to scheduling within a GT cell that implicitly takes advantage of common setups and part family coding structures.
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.
