Abstract
We study proportionate flow shop scheduling problem allowing job rejection. The objective function is to minimize the earliness, tardiness, due date cost, and rejection cost. We consider the collaboration between the manufacturer and supplier. The common due date is measured in two-ways, which is only related to accepted jobs (total rejection case) or all jobs share a common due date (semi-rejection case). We show the relation between proportionate flow shop and single-machine problems, use the properties of single-machine to solve proportionate flow shop problems with job rejection, and propose the corresponding dynamic programming algorithm and algorithm complexity for the problems.
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.
