A dynamic programming formulation for the one maschine sequencing problem
Year of publication: |
1978
|
---|---|
Authors: | Weeda, P. J. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 2.1978, 4, p. 298-300
|
Subject: | Programmanalyse dynamisch | Unternehmensforschung | Reihenfolgeproblem |
-
On dynamic programming methods for assembly line balancing
Kao, Edward P. C., (1982)
-
A dynamic programming solution to the dynamic, multi-item, single-machine scheduling problem
Gascon, André, (1988)
-
Notes on the theory of dynamic programming-transportation models
Bellman, Richard, (1958)
- More ...
-
Heterogeneous batch structures in throughput scheduling
Weeda, P. J., (1993)
-
Maximizing throughput by evaluating critical utilization paths
Weeda, P. J., (1991)
-
On the determination of overplanning margins for components in a consumer electronics factory
Kamp, A. P. G. M., (1989)
- More ...