Parallel machine scheduling with precedence constraints and setup times

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search methods mixed with local search principles, dominance conditions and specific lower bounds are proposed. The proposed methods are evaluated on a set of randomly generated instances and compared with previous results from the literature and those obtained with an efficient commercial solver. We conclude that our propositions are quite competitive and our results even outperform other approaches in most cases.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Parallel machine scheduling with precedence constraints and setup times does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parallel machine scheduling with precedence constraints and setup times, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel machine scheduling with precedence constraints and setup times will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-128252

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.