Minimizing makespan in flowshop with time lags

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

2 pages. Also available at http://hal.inria.fr/inria-00000149

Scientific paper

We consider the problem of minimizing the makespan in a flowshop involving
maximal and minimal time lags. Time lag constraints generalize the classical
precedence constraints between operations. We assume that such constraints are
only defined between operations of the same job. We propose a solution method
and present several extensions.

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

Minimizing makespan in flowshop with time lags 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 Minimizing makespan in flowshop with time lags, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing makespan in flowshop with time lags will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-611432

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