Abstract
SUMMARY In general job shop scheduling, n jobs have to be scheduled on m machines. We consider the job shop scheduling problems in which there are orders with sizes greater than one (therefore there are multiple identical jobs), and in which each operation can be processed on several machines (therefore there are alternative routeings for the operations). These characteristics of the problems impose special precedence relationships among operations. We compare various dispatching rules for list scheduling algorithms and test several methods for defining successors of an operation using the precedence relationships. Mean tardiness, mean flow time, and number of tardy jobs are used as performance measures in the comparison.
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.
