Path and equipment allocation for multiple, concurrent processes on networked process plant units
Abstract The path and equipment allocation problem for batch processes is defined and cast in the context of graph theory. Networks of interconnected process equipment are represented by directed graphs. Inter-unit material transfer paths and equipment allocations are found using a shortest path algorithm and subsequently isolated to prevent cross-contamination. The results are applicable to real-time implementation in operating plants.
NDSL에서는 해당 원문을 복사서비스하고 있습니다. 위의 원문복사신청 또는 장바구니 담기를 통하여 원문복사서비스 이용이 가능합니다.
- 이 논문과 함께 출판된 논문 + 더보기