Competitive production scheduling: A two-firm, noncooperative finite dynamic game
From MaRDI portal
(Redirected from Publication:2365098)
Recommendations
Cites work
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A note on determining pure-strategy equilibrium points of bimatrix games
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Dynamic noncooperative game theory
- Dynamic Oligopoly with Inventories
- Flowshop scheduling with limited temporary storage
- scientific article; zbMATH DE number 4061056 (Why is no real title available?)
- Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
- Optimal control of production rate in a failure prone manufacturing system
- Probability of a pure equilibrium point in n-person games
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
- The Role of Inventory in Delivery-Time Competition
Cited in
(4)
This page was built for publication: Competitive production scheduling: A two-firm, noncooperative finite dynamic game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365098)