Competitive production scheduling: A two-firm, noncooperative finite dynamic game
From MaRDI portal
Publication:2365098
DOI10.1007/BF02205446zbMath0868.90055OpenAlexW1993055343MaRDI QIDQ2365098
Publication date: 4 February 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02205446
production schedulingfinite planning horizoncompetitive environmentrandom breakdownsfinite dynamic gameNash policies
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Economic growth models (91B62) Other game-theoretic models (91A40)
Related Items
Cites Work
- Unnamed Item
- Dynamic noncooperative game theory
- A note on determining pure-strategy equilibrium points of bimatrix games
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Optimal control of production rate in a failure prone manufacturing system
- Flowshop scheduling with limited temporary storage
- The Role of Inventory in Delivery-Time Competition
- Dynamic Oligopoly with Inventories
- Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
- Probability of a pure equilibrium point in n-person games