Abstract

This paper presents a parallel machine scheduling problem with process quality, due dates, and sequence-dependent setup times. The process capability indices are utilized to measure the process quality level between job and machine. The dispatching algorithm named quality and rework with due dates (QRD) is proposed in this paper focusing on the rework processes due to quality issue. The performance of QRD is measured by two ways: one is quality-related performance indicator—process capability index—and the other is due date related ones: maximum lateness, mean flow time, and the number of reworks. A large number of test problems are randomly generated to evaluate the performance of the proposed algorithm. Computational results show that the proposed algorithm is significantly superior to existing dispatching algorithms for the test problems.

Full Text
Paper version not known

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 call

Disclaimer: 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.