Because of activity duration uncertainties, large-scale projects can often be modeled most realistically as probabilistic activity networks. The complex interactions among activities with uncertain durations virtually assures a low probability that these projects will be completed before...

The paper studies a flowshop scheduling problem where machines are not available in given time intervals. The objective is to minimize the makespan. The problem is known to be NP-hard for two machines. We analyze constructive and local search based heuristic algorithms for the two-machine case....

This paper addresses the scheduling of jobs with sequence dependent setup times in a deterministic, static flowshop scenario. Four heuristics are described and compared with three benchmarks which represent generally practiced approaches to scheduling in this environment. Performance results are...