Mean flow time minimization with given bounds of processing times

Mean flow time minimization with given bounds of processing times

0.00 Avg rating0 Votes
Article ID: iaor20052536
Country: Netherlands
Volume: 159
Issue: 3
Start Page Number: 558
End Page Number: 573
Publication Date: Dec 2004
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: optimization
Abstract:

We consider a job shop scheduling problem under uncertain processing times and fixed precedence and capacity constraints. Each of the random processing times can take any real value between given lower and upper bounds. The goal is to find a set of schedules which contains at least one optimal schedule (with mean flow time criterion) for any admissible realization of the random processing times. In order to compute such a set of schedules efficiently and keep it as small as possible, we develop several exact and heuristic algorithms and report computational experience based on randomly generated instances.

Reviews

Required fields are marked *. Your email address will not be published.