A Branch-and-Bound to solve the scheduling problem Pm/r&lt;sub&gt;j&lt;/sub&gt;/&amp;#x003A3;T&lt;sub&gt;j&lt;/sub&gt;

F Yalaoui

doi:10.1109/icsssm.2006.320679

A Branch-and-Bound to solve the scheduling problem Pm/r<sub>j</sub>/&#x003A3;T<sub>j</sub>

F Yalaoui

https://doi.org/10.1109/icsssm.2006.320679

Copy DOI

Publication Date: Oct 1, 2006

Citations: 18

Affiliation: University of Technology of Troyes, French National Centre for Scientific Research

#Release Dates Of Jobs #Parallel Machine Scheduling Problem + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

This paper presents the first study for the total tardiness minimization on parallel machine scheduling problem with different release dates of jobs. In this problem, a set of jobs has to be scheduled, without any preemption or splitting, on identical parallel machine. Each job has a due date and a release date. A polynomial lower bound is proposed using a relaxation procedure. A set of dominance properties are also established. A branch and bound algorithm is developed by taking into account the theoretical properties, lower and also upper bounds. This exact method has been tested on a large number of randomly generated problems. The obtained results are promising

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 call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: 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.