Premium
DYNAMIC FEEDING IN A STOCHASTIC PARALLEL PROCESSING SYSTEM
Author(s) -
LIU JOHN J.
Publication year - 1992
Publication title -
production and operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.279
H-Index - 110
eISSN - 1937-5956
pISSN - 1059-1478
DOI - 10.1111/j.1937-5956.1992.tb00362.x
Subject(s) - computer science , construct (python library) , scheduling (production processes) , mathematical optimization , ideal (ethics) , machining , stochastic optimization , algorithm , mathematics , philosophy , materials science , epistemology , metallurgy , programming language
I consider a dynamic input scheduling problem of a stochastic parallel processing system consisting of n identical flexible machining cells. The processing times at each cell are independent random variables. Previous study has indicated the NP complexity of the problem. In this paper, I prove the separability under an ideal just‐in‐time input condition. Using the separability, I then construct an approximation procedure for most realistic applications where the separability condition is violated. The approximation procedure requires only linear time and performed quite well on an extensive test with numerical examples.