Abstract
A set of n nonpreemptive tasks are to be scheduled on m dedicated machines in order to minimize the overall makespan. Precedence constraints among the tasks, deterministic processing times and processing machine of each task are given. We present lower bounds of the minimum makespan and heuristic algorithms for two relevant cases in manufacturing applications, namely when the precedence constraints form a comb or a caterpillar. Promising preliminary computational tests are also reported proving the efficiency and effectiveness of the proposed solution algorithm.
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.
