TY - JOUR

T1 - Optimal dynamic load distribution in a class of flow-type flexible manufacturing systems

AU - Jo, K. Y.

AU - Maimon, O. Z.

PY - 1991/11/6

Y1 - 1991/11/6

N2 - This paper studies optimal dynamic load-distribution among parallel single-stage stations in flexible manufacturing systems and characterizes the form of the optimal policies as a function of the system state. Each work station maintains its own buffer and has independent input and output processes. At each decision epoch, a central Work-In-Process controller redistributes and routes jobs among all stations to minimize the total expected operating cost of the network system. The optimal policy for the system prescribes how many jobs will be sent to (taken from) each station so that optimal load balancing among all stations is implemented. The model takes into account holding and shortage costs for all the stations, which are assumed to be convex increasing functions, and routing costs as well. It is proved that the optimal action (number of jobs to be received) for a station is monotonically decreasing, as the number of jobs at the station grows, and is monotonically increasing, as the number of jobs at any other station grows. The resultant properties of the optimal policies for the model give fundamental guidelines on how optimal routing can be done among parallel stations by generalizing from a single-stage situation. Finally, a numerical example is presented to display the analytically proven properties of the optimal policies.

AB - This paper studies optimal dynamic load-distribution among parallel single-stage stations in flexible manufacturing systems and characterizes the form of the optimal policies as a function of the system state. Each work station maintains its own buffer and has independent input and output processes. At each decision epoch, a central Work-In-Process controller redistributes and routes jobs among all stations to minimize the total expected operating cost of the network system. The optimal policy for the system prescribes how many jobs will be sent to (taken from) each station so that optimal load balancing among all stations is implemented. The model takes into account holding and shortage costs for all the stations, which are assumed to be convex increasing functions, and routing costs as well. It is proved that the optimal action (number of jobs to be received) for a station is monotonically decreasing, as the number of jobs at the station grows, and is monotonically increasing, as the number of jobs at any other station grows. The resultant properties of the optimal policies for the model give fundamental guidelines on how optimal routing can be done among parallel stations by generalizing from a single-stage situation. Finally, a numerical example is presented to display the analytically proven properties of the optimal policies.

KW - FMS operational control

KW - Optimal load distribution

KW - control of parallel stations

KW - monotone optimal policies

KW - optimal routing

KW - production smoothing

UR - http://www.scopus.com/inward/record.url?scp=0026418373&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(91)90192-X

DO - 10.1016/0377-2217(91)90192-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0026418373

VL - 55

SP - 71

EP - 81

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -