Der optimale Ablaufplan
暂无分享，去创建一个
[1] H. M. Wagner,et al. Approximate Solutions to the Three-Machine Scheduling Problem , 1964 .
[2] J. Piehler,et al. Ein Beitrag zum Reihenfolgeproblem , 1960, Unternehmensforschung.
[3] Alan S. Manne,et al. On the Job-Shop Scheduling Problem , 1960 .
[4] George Logemann,et al. An Algorithm for the Construction and Evaluation of Feasible Schedules , 1962 .
[5] E. H. Bowman. THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .
[6] S. Akers. Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .
[7] George L. Nemhauser,et al. A Geometric Model and a Graphical Algorithm for a Sequencing Problem , 1963 .
[8] D. Koenig. Theorie Der Endlichen Und Unendlichen Graphen , 1965 .
[9] Richard A. Dudek,et al. Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .
[10] Jack Heller,et al. Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .
[11] George B. Dantzig,et al. A Machine-Job Scheduling Model , 1960 .
[12] M. Algan,et al. Reihenfolgeprobleme und Graphentheorie , 1964, Unternehmensforschung.
[13] Wlodzimierz Szwarc,et al. SOLUTION OF THE AKERS-FRIEDMAN SCHEDULING PROBLEM , 1960 .
[14] G. Thompson,et al. Algorithms for Solving Production-Scheduling Problems , 1960 .