TY - JOUR

T1 - Scheduling one-part-type serial manufacturing system under periodic demand

T2 - A solvable case

AU - Kogan, Konstantin

AU - Lou, Sheldon X.C.

PY - 2002/8

Y1 - 2002/8

N2 - The paper studies one-part type, multiple-stage production system with periodic demands. A buffer of infinite capacity is placed after each machine. Inventory flow through buffers is controlled by machine production rates. The objective is to find a cyclic production rate, which minimizes all inventory-related expenses over an infinite planning horizon. With the aid of the maximum principle, optimal production policies are derived and the continous-time scheduling problem is reduced to a discrete timing problem. As a result, a polynomial-time algorithm is suggested to calculate the optimal production rate. A numerical example is used to illustrate the algorithm. Numerical and heuristic approaches have been suggested for production control of automated-serial-manufacturing systems. These approaches try to derive production control policies that would minimize overall costs related to inventory, backlog, and production. The quality of these approaches is often difficult to assess, and they can be time-consuming to implement. Therefore, increasing attention has been directed to optimal control policies of production systems that can be derived precisely and quickly. This paper addresses a special case of the production system manufacturing a single product type to meet a periodic demand. Given a certain assumption on cost relationship, we derive a fast and simple scheduling algorithm that calculates the optimal policy.

AB - The paper studies one-part type, multiple-stage production system with periodic demands. A buffer of infinite capacity is placed after each machine. Inventory flow through buffers is controlled by machine production rates. The objective is to find a cyclic production rate, which minimizes all inventory-related expenses over an infinite planning horizon. With the aid of the maximum principle, optimal production policies are derived and the continous-time scheduling problem is reduced to a discrete timing problem. As a result, a polynomial-time algorithm is suggested to calculate the optimal production rate. A numerical example is used to illustrate the algorithm. Numerical and heuristic approaches have been suggested for production control of automated-serial-manufacturing systems. These approaches try to derive production control policies that would minimize overall costs related to inventory, backlog, and production. The quality of these approaches is often difficult to assess, and they can be time-consuming to implement. Therefore, increasing attention has been directed to optimal control policies of production systems that can be derived precisely and quickly. This paper addresses a special case of the production system manufacturing a single product type to meet a periodic demand. Given a certain assumption on cost relationship, we derive a fast and simple scheduling algorithm that calculates the optimal policy.

KW - Optimal control

KW - Scheduling

KW - Serial manufacturing systems

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

U2 - 10.1016/s0305-0548(01)00024-7

DO - 10.1016/s0305-0548(01)00024-7

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

AN - SCOPUS:0036680964

SN - 0305-0548

VL - 29

SP - 1195

EP - 1206

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 9

ER -