a subsurface drainage network mainly carries unsteady flow and data are not usually available for model parameters calibration in such networks. in the present research, the finite volume method using the time splitting scheme was employed to develop a computer code for solving the one dimensional unsteady flow equations. using corrugated sub drainage pipes, an experimental prototype setup was ...

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

We consider two queueing control problems that are stochastic versions of the economic lot scheduling problem: A single server processes N customer classes, and completed units enter a 'nished goods inventory that services exogenous customer demand. Unsatis'ed demand is backordered, and each class has its own general service time distribution, renewal demand process, and holding and backorderin...

Recently Koulamas and Kyparisis (2006) introduced past-sequence-dependent setup times to scheduling problems. This means that the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. Koulamas and Kyparisis (2006) were able to show for a number of single-machine scheduling problems with completion time goals that they remain polynomially solvable. In...

In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i  j, the duration of this set-up being the sequ...