Abstract
Abstract This paper is concerned with sequencing a finite number of jobs when there is a fixed number of identical machines and each job requires several machines working simultaneously for a given length of time. Performance criteria are minimizing average completion time and minimizing the maximum completion time. Optimal solutions for small problems were computed by branch-and-bound. Heuristic sequencing rules were applied to the same problems and a set of larger problems. Sequencing jobs by giving preference to large machine-hour requirements and then reversing the schedule gave fairly good performance on both measures, although other methods work better against the average completion time criteria.
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.
