Several problems, including the long-range process design problem, have been formulated as a compatibility matrix. Earlier, Singhal et al. (1988) proposed a partial enumeration algorithm which found all feasible designs and reported computational results. However, for large problems, the partial...

Most processes consist of several operations. Some or all of these operations may have more than one alternative technological method, resulting in an exponential relationship between the number of possible designs and the number of operation alternatives. However, some of these designs may not...

This paper defines a model that covers the multimachine extensions of all existing flow-shop problems with time lags as well as flow-shop problems where setup, processing and release times are separated. Approximate solutions and lower completion time bounds are developed for the restricted and...

The Chinese postman problem is to find a least cost way to traverse each arc of a network at least once and to return to the vertex from which you started. Diverse problems such as the routing of road crews, police patrol scheduling, garbage collection and the programming of computer map...