Abstract
The scheduling problem n/3/F/ C max with arbitrary precedence constraints between the jobs is studied. A branch and bound algorithm is described. Bounds are obtained by solving 2-machine subproblems which are relaxed versions of the current 3-machine problem. These 2-machine problems which have precedence constraints can be quickly solved in an optimal fashion only if the constraints are of a series-parallel (S-P) form. Using methods described in [5], we find an S-P constraints subgraph which may be solved to obtain a lower bound for each 2-machine subproblem. This provides the basis for the calculation of an effective lower bound for the 3-machine case. Computational experience with the algorithm is reported.
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.
