Abstract
The development of a scheduling methodology for module processing in thin film transistor liquid crystal display manufacturing is presented. The problem is a parallel machine-scheduling problem with family set-up times and due dates. Two objectives are considered: total tardiness and the number of family set-ups. Two heuristics are developed based on the MULTIFIT method and tabu search. The experimental results show that the proposed algorithms give schedules that are very efficient in terms of both total tardiness and the number of family set-ups.
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.
