Flexibility and Robustness in Scheduling

When scheduling problems arise from several application domains, solving them requires tools of combinatorial optimization and exact or approximated algorithms. This reference focuses on the integration of flexibility and robustness considerations in the study of scheduling problems. After conisidering both factors, it then covers various scheduling problems, treated with an emphasis on either flexibility or robustness--or both. A truly invaluable reference, it includes information on a model of permutation stochastic flowstop, resource allocation in project planning, sensitivity analyses for one or more machines, and contributions of a proactive/reactive approach to control time-critical systems.