Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Guidelines For Establishing Irrigation Scheduling Policies, Charles M. Burt
Guidelines For Establishing Irrigation Scheduling Policies, Charles M. Burt
BioResource and Agricultural Engineering
Successful on-farm irrigation scheduling requires that water delivery projects adopt a service concept, and that water deliveries be made with a high degree of reliability. An arranged delivery schedule and seasonal volumetric allocations are additional requirements. Until these conditions are met, attempts to implement modern on-farm irrigation scheduling techniques to maximize water use efficiency, and to maximize yields will be only partially successful.
Using Dynamic Cellular Manufacturing To Simplify Scheduling In Cell Based Production Systems, Vijay R. Kannan, Soumen Ghosh
Using Dynamic Cellular Manufacturing To Simplify Scheduling In Cell Based Production Systems, Vijay R. Kannan, Soumen Ghosh
Management Faculty Publications
Previous research has shown that the formation of temporary, logical manufacturing cells in a job shop, overcomes problems of high setup frequency typically found in job shops. In addition, this form of cellular configuration is more flexible than tranditional, group technology based cellular configurations. This research demonstrates that an added benefit of a dynamic cellular configuration is that it simplifies production scheduling, eliminating the need for more complex dispatching rules. In particular, it eliminates the need for further setup reduction when scheduling parts from the same family. Improvements in performance when employing setup reduction are shown to occur only when …
An Optimal Path Cover Algorithm For Cographs, R. Lin, S. Olariu
An Optimal Path Cover Algorithm For Cographs, R. Lin, S. Olariu
Computer Science Faculty Publications
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, we present an optimal algorithm for determining a minimum path cover for a cograph G. In case G has a Hamiltonian path (cycle) our algorithm exhibits the path (cycle) as well.