Showing 1 - 10 of 43
This paper considers an infinite horizon stochastic production planning problem with the constraint that production rate must be nonnegative. It is shown that an optimal feedback solution exists for the problem. Moreover, this solution is characterized and is then compared with the solution of...
Persistent link: https://www.econbiz.de/10012746449
A general sates-advertising model is developed in which the state of the system represents a population distribution over a parameter space. With appropriate interpretations, this can include income, family size, geographic distributions, etc. Effects of information diffusion, interaction, and...
Persistent link: https://www.econbiz.de/10014219070
Persistent link: https://www.econbiz.de/10014098097
Persistent link: https://www.econbiz.de/10003984231
Persistent link: https://www.econbiz.de/10001190598
Persistent link: https://www.econbiz.de/10001268453
Ever since the publication of Pontryagin's Maximum Principle, the number of its applications to management science problems has been steadily growing. This paper is an up-to-date survey of the applications of the deterministic maximum principle to the three functional areas of management:...
Persistent link: https://www.econbiz.de/10013069528
A mixed optimization technique for optimal machine replacement is presented which allows much more flexibility than previous models. Optimal purchase, maintenance and sale of a given machine between any two given points in time is treated as a subproblem, which one may choose to solve via...
Persistent link: https://www.econbiz.de/10013071069
Management science applications frequently involve problems of controlling continuous time dynamic systems, that is, systems which evolve over time. Optimal control theory, a relatively new branch of mathematics, determines the optimal way to control such a dynamic system. The purpose of this...
Persistent link: https://www.econbiz.de/10013071070
We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...
Persistent link: https://www.econbiz.de/10013152472