Abstract
• We consider the ordered and the proportionate flow shop with unequal machine speeds. • We consider both the C max and the ∑ j = 1 n C j objectives. • We show that permutation schedules are dominant for C max with V-shaped speeds. • We show that permutation schedules are dominant for ∑ j = 1 n C j with three stages.
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.
