Towards an adaptive Kanban system
International Journal of Production ResearchPublished 1 March 1990
Abhijit Chaudhury, Andrew B. Whinston
Citations20
SJR quartileQ1
SJR score2.24
SNIP2.56
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A control methodology for flow shops that is decentralized and adaptive in nature, and has low data handling and computational requirements is presented and relationship of the control model to computational models such as neural computing is discussed.
Abstract
SUMMARY This paper presents a control methodology for flow shops that is decentralized and adaptive in nature, and has low data handling and computational requirements. The methodology is based on stochastic automata methods for modelling learning behaviour. It is proposed that such a methodology can be used with Kanban type control technique to make flow shop systems more flexible and adaptive in nature, Relationship of the control model to computational models such as neural computing is discussed.
Keywords
Computer ScienceEngineering
The MIT Press eBooksParallel Distributed Processing
15,227 Citations1986David E. Rumelhart, James L. McClelland +1 more
Management ScienceGames with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model
2,181 Citations2004John C. Harsanyi
The paper develops a new theory for the analysis of games with incomplete information where the players are uncertain about some important parameters of the game situation, such as the payoff functions, the strategies available to various players, the information other players have about the game, etc.
Management ScienceGames with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
2,110 Citations1967John C. Harsanyi
Manufacturing Planning and Control Systems
1,039 Citations1984Thomas E. Vollmann, William L. Berry +1 more
IEEE Transactions on Systems Man and CyberneticsLearning Automata - A Survey
664 Citations1974Kumpati S. Narendra, M.A.L. Thathachar
Attention has been focused on the norms of behavior of learning automata, issues in the design of updating schemes, convergence of the action probabilities, and interaction of several automata.
Management ScienceFlexible Manufacturing Systems: A Review of Analytical Models
460 Citations1986John A. Buzacott, David D. Yao
A number of directions in which models require extension are outlined, in particular the representation of such aspects of FMS operation as the tool delivery systems, the blocking phenomenon, the transient behavior and the differences between flexible machining systems and flexible assembly systems.
Learning Algorithms Theory and Applications
299 Citations1981S. Lakshmivarahan
Theory and Applications: Two-Person Zero-Sum Sequential, Stochastic Games with Imperfect and Incomplete Information - General Case, and The LAR?P - Algorithm and Statement of Results.
An algorithm for the computer control of production in a flexible manufacturing system
184 Citations1981Joseph Kimemia, Stanley B. Gershwin
A three-level hierarchical control algorithm is proposed which involves stochastic optimal control, network optimization, and scheduling of an automated manufacturing system.
IEEE Transactions on Components Hybrids and Manufacturing TechnologyPerformance of Hierarchical Production Scheduling Policy
143 Citations1984Ram Akella, Yong F. Choong +1 more
Simulation results based on a detailed model of an IBM printed circuit card assembly facility are presented and Kimemia and Gershwin's hierarchical scheduling scheme for flexible manufacturing systems is shown to be superior.
IEEE Transactions on Software EngineeringStability and Distributed Scheduling Algorithms
78 Citations1985John A. Stankovic
Computer Networks (1976)Simulations of three adaptive, decentralized controlled, job scheduling algorithms
70 Citations1984John A. Stankovic
Simulation results of three adaptive, decentralized controlled job scheduling algorithms which assume absolutely no a priori knowledge about jobs are presented, and it is observed that, if tuned correctly, the decentralized algorithms exhibit stable behavior and considerably improve performance at modest cost.
IEEE Transactions on Systems Science and CyberneticsOn Expediency and Convergence in Variable-Structure Automata
63 Citations1968B. Chandrasekaran, D. C. Shen
The efficiency of learning for an m-state automaton in terms of expediency and convergence, under two distinct types of reinforcement schemes: one based on penalty probabilities and the other on penalty strengths, is discussed.
The Factory of the Future
44 Citations1982John A. White
Automatic planning and flexible scheduling: A knowledge-based approach
34 Citations2005Michael J. Shaw, Andrew B. Whinston
A knowledge-based approach is used to handle a planning system, where three levels-i.e., the control, state, and operational levels-constitute its manufacturing knowledge, where the dynamically adjustable plan can be constructed on-line.
Mathematics of Operations ResearchLearning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information
33 Citations1981S. Lakshmivarahan, Kumpati S. Narendra
This paper investigates conditions under which two learning algorithms playing a zero-sum sequential stochastic game would arrive at optimal pure strategies.
A two-level system of stochastic automata for periodic random environments
33 Citations1971Kumpati S. Narendra, R. Viswanathan
A class of nonstationary environments with unknown but periodically changing probabilistic characteristics is considered and a two-level system of variable-structure stochastic automata is proposed to optimize the performance.
IEEE Transactions on Systems Man and CyberneticsOn the Learning Behavior of Stochastic Automata Under a Nonstationary Random Environment
29 Citations1975Norio Baba, Yoshikazu SAWARAGI
The learning performance of the Lr-1 scheme under R(C1(t),..., Cr(t,¿)) is discussed, where t represents time and Cr represents time, with B being the supporting set of a probability measure space.
National Conference on Artificial IntelligenceMaterial handling: a conservative domain for neural connectivity and propagation
28 Citations1987H. Van Dyke Parunak, James Kindrick +1 more
The problem domain and the connectionist structure of CASCADE are reviewed, the scheme for maintaining connectivitV information and propagating signals is described, and some experiments with the sVstem are reported.
IEEE Transactions on Systems Man and CyberneticsAn N-player sequential stochastic game with identical payoffs
22 Citations1983Kumpati S. Narendra, Richard M. Wheeler
It is shown that the expected change in each player's payoff is nonnegative at every instant, so that the group improves its performance monotonically, which appears to have important implications in decentralized decision-making in large complex systems.
AutomaticaLearning models for decentralized decision making
17 Citations1985Richard M. Wheeler, Kumpati S. Narendra
This paper presents a learning approach to the modeling of decentralized decision making problems, and models in which all decision makers act and update decisions synchronously are shown to lead to repeated strategic games.
Information SciencesOptimal non-linear reinforcement schemes for stochastic automata
15 Citations1972S. Lakshmivarahan, M.A.L. Thathachar
Two optimal non- linear reinforcement schemes for the two-state automaton functioning in a stationary random environment are considered and very simple conditions of symmetry of the non-linear function figuring in the reinforcement scheme are shown to be necessary and sufficient for optimality.
IEEE Transactions on Systems Man and CyberneticsOn the learning behaviors of variable-structure stochastic automaton in the general n-teacher environment
8 Citations1983Norio Baba
It is shown that the GLR-I scheme is absolutely expedient and ϵ-optimal in the generaln-teacher environment.