this paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...

This paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. Since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...

Many diseases are related to cerebrospinal .uid (CSF) hydrodynamics. Therefore, understanding the hydrodynamics of CSF .ow and intracranial pressure is helpful for obtaining deeper knowledge of pathological processes and providing better treatments. Furthermore, engineering a reliable computational method is promising approach for fabricating in vitro models which is essential for inventing gen...

many diseases are related to cerebrospinal .uid (csf) hydrodynamics. therefore, understanding the hydrodynamics of csf .ow and intracranial pressure is helpful for obtaining deeper knowledge of pathological processes and providing better treatments. furthermore, engineering a reliable computational method is promising approach for fabricating in vitro models which is essential for inventing gen...

In this paper we describe a problem that we de ne as the Budget-Constrained Minimum Cost Flow (BCMCF) problem. The BCMCF problem is a natural extension of the well-known Minimum Cost Flow (MCF) [2] problem, with a xed cost related to the use of arcs and a budget constraint. Network ow problems often become hard when extra constraints are added. Ahuja and Orlin [1] discuss the constrained maximu...

We show that an "-approximate solution of the cost-constrained K-commodity ow problem on an N-nodeM-arc network G can be computed by sequentially solving O K(" 2 + logK) logM log(" 1 K) single-commodity minimum-cost ow problems on the same network. In particular, an approximate minimumcost multicommodity ow can be computed in ~ O(" 2 KNM) running time, where the notation ~ O( ) means \up to log...

This paper presents a comparison study of the computational complexity of the general job shop protocol and the ow line protocol in a exible manufacturing system. It is shown that 2 a certain representative problem of nding resource invariants is NP-complete in the case of the job shop, while in the ow line case it admits a closed-form solution. The importance of correctly selecting part ow and...

A ̄exible manufacturing system (FMS) is highly capital-intensive and FMS users are concerned with achieving high system utilization. The production planning function for setting up an FMS prior to production should be developed in order to make the most of the potential bene®ts of FMSs. We consider two production planning problems of grouping and loading a ̄exible ̄ow system, which is an important...

We study optimal procurement mechanisms for a financially constrained buyer subject to ex post incentive compatibility and individual rationality. In our setup, a buyer who has a fixed budget wishes to purchase a homogeneous product up to a maximum demand amount. We characterize the optimal mechanism when the budget constraint always binds and when the maximum demand constraint always binds. Wh...

Work ow systems hold the promise of facilitating the everyday operation of many enterprises and work environments. As a result, many commercial work ow management systems have been developed. These systems, although useful, do not scale well, have limited fault-tolerance, and are in exible in terms of interoperating with other work ow systems. In this paper, we discuss the limitations of contem...