Abstract
We derive an index priority rule for an m-machine no-wait flow shop with the minimum makespan objective and specially-structured job processing times. Our rule generalizes the previously known rules for two special cases of the problem. We also derive an index priority rule for a two-machine no-wait flow shop with the minimum weighted total job completion time objective when all jobs have the same processing time on the first machine. We then show that additional index priority rules can be derived for the latter problem with other scheduling objectives. Finally, we discuss extensions to flow shops with blocking and no-wait job shops and open shops.
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.
