The paper deals with the classical problem of minimizing the makespan in a two-machine flow shop. When the job processing times are deterministic, the optimal job sequence can be determined by ...

James R. Prairie; Balaji Rajagopalan; Terry J. Fulp; and Edith A. Zagona, M.ASCE. “Modified K-NN Model for Stochastic Streamflow Simulation,” Journal of Hydrologic Engineering, 11(4), July 1, 2006.

A theory based on the precedence relation (dominance condition with no fixed presequence) concept has been developed and applied to the flow-shop problem. The nature and scope of two major precedence ...

Abstract: Streamflow disaggregation techniques are used to distribute a single aggregate flow value to multiple sites in both space and time while preserving distributional statistics (i.e., mean, ...