Abstract
In this paper, we study the production scheduling problem in a competitive environment. Two firms produce the same product and compete in a market. The demand is random and so is the production capacity of each firm, due to random breakdowns. We consider a finite planning horizon. The scheduling problem is formulated as a finite dynamic game. Algorithms are developed to determine the security, hazard, and Nash policies. Numerical examples are discussed. A single-firm optimization model is also analyzed and it is observed that the production control policy from the single-firm optimization model may not perform well in a competitive environment.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Afentakis, B. Gavish and U. Karmarkar, Computationally efficient optimal solutions to the lotsizing problem in multi-stage assembly systems, Management Science 30(1984)222–239.
R. Akella and P.R. Kumar, Optimal control of production rates in a failure prone manufacturing system, IEEE Transactions on Automatic Control AC-31(1986)116–126.
S.X. Bai, Scheduling manufacturing systems with work-in-process inventory control, Ph.D. Thesis, MIT, 1991.
S.X. Bai, A note on determining pure-strategy equilibrium points of bimatrix games, Computers and Mathematics with Application (1996), to appear.
T. Basar and G.T. Olsder,Dynamic Noncooperative Game Theory, Academic Press, 1982.
D.P. Bertsekas,Dynamic Programming; Deterministic and Stochastic Models, Prentice-Hall, 1987.
M. Dresher, Probability of a pure equilibrium point inn-person games, Journal of Combinatorial Theory 8(1970).
S.B. Gershwin, Hierarchical flow control; A framework for scheduling and planning discrete events in manufacturing systems, Proceedings of the IEEE, Special Issue on Dynamics of Discrete Event Systems 77(1989)195–209.
J. Kimemia and S.B. Gershwin, An algorithm for the computer control of a flexible manufacturing system, IIE Transactions 15(1983)353–362.
A.P. Kirman and M.J. Sobel, Dynamic oligopoly with inventories, Econometrica 42 (1974).
B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, A general bounding scheme for the permutation flow-shop problem, Operations Research 26(1978)53–67.
R. Levitan and M. Sobel, Price variation duopoly with differentiated products and random demand, Journal of Economic Theory 3 (1971).
L. Li, The role of inventory in delivery-time competition, Management Science 38(1992).
E.F.P. Newson, Multi-item lot size scheduling by heuristic, Part I: With fixed resources, Management Science 21(1975)1186–1193.
C.H. Papadimitriou and P.C. Kannelakis, Flowshop scheduling with limited temporary storage, Journal of the ACM 27(1980).
H.M. Wagner and T.M. Whitin, Dynamic version of the economic lot size model, Management Science 5(1958)89–96.
L.M. Wein, Scheduling semiconductor wafer fabrication, IEEE Transactions on Semiconductor Manufacturing 1(1988).
L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a two-station closed network with controllable inputs, Operations Research 38(1990).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bai, S.X. Competitive production scheduling: A two-firm, noncooperative finite dynamic game. Ann Oper Res 68, 1–31 (1996). https://doi.org/10.1007/BF02205446
Issue Date:
DOI: https://doi.org/10.1007/BF02205446