This paper deals with networking problem of two queues in bitandem with scheduling of jobs on two preordered machines in a flow-shop setup for minimizing the total idle time of machines and for determining the minimum total waiting time of the customers/items corresponding to the optimal sequence of jobs/items determined in the flow-shop setup.
展开▼
