A Total Maximum Daily Load (TMDL) program has been initiated in the North Bosque River Watershed in Texas, USA, where point and nonpoint sources of pollution are of a concern. The Soil and Water Assessment Tool (SWAT), which had been validated for flow and sediment and nutrient transport, was applied to quantify the effects of Best Management Practices (BMPs) related to dairy manure management ...

We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such ...

Co-flows model a modern scheduling setting that is commonly found in a variety of applications in distributed and cloud computing. In co-flow scheduling, there are m input ports and m output ports. Each co-flow j ∈ J can be represented by a bipartite graph between the input and output ports, where each edge (i, o) with demand dji,o means that d j i,o units of packets must be delivered from port...

We consider an uncertain single-machine scheduling problem, in which the processing time of a job can take any real value on a given closed interval. The criterion is to minimize the total weighted flow time of the n jobs, where there is a weight associated with a job. We calculate a number of minimal dominant sets of the job permutations (a minimal dominant set contains at least one optimal pe...

We consider an uncertain single-machine scheduling problem, in which the processing time of a job can take any real value from a given closed interval. The criterion is to minimize the sum of weighted completion times of the n jobs, a weight being associated with each job. For a job permutation, we study the stability box, which is a subset of the stability region. We derive an O(n log n) algor...

We consider a single-machine scheduling problem with each job having an uncertain processing time which can take any real value within each corresponding closed interval before completing the job. The scheduling objective is to minimize the total weighted flow time of all n jobs, where there is a weight associated with each job. We establish the necessary and sufficient condition for the existe...