Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
暂无分享,去创建一个
[1] J. M. Tamarit,et al. Project scheduling with resource constraints: A branch and bound approach , 1987 .
[2] B. Roy,et al. Les Problemes d'Ordonnancement , 1967 .
[3] E. W. Davis,et al. Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .
[4] J. D. Wiest,et al. Management Guide to PERT/CPM , 1969 .
[5] Hans-Otto Günther,et al. Netzplanorientierte Auftragsterminierung bei offener Fertigung , 1992 .
[6] S. Elmaghraby,et al. The Analysis of Activity Networks Under Generalized Precedence Relations GPRs , 1992 .
[7] Ji Zhan,et al. Heuristics for scheduling resource-constrained projects in MPM networks , 1994 .
[8] Steven Nahmias,et al. Production and operations analysis , 1992 .
[9] Erik Demeulemeester,et al. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .
[10] James H. Patterson,et al. An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems , 1978 .
[11] Charles R. Standridge,et al. Modeling and Analysis of Manufacturing Systems , 1993 .
[12] Klaus Neumann,et al. Heuristic procedures for resource—constrained project scheduling with minimal and maximal time lags: the resource—levelling and minimum project—duration problems , 1996 .
[13] Rolf H. Möhring,et al. Scheduling project networks with resource constraints and time windows , 1988 .
[14] B. Fleischmann,et al. Konzeptionelle Grundlagen kapazitätsorientierter PPS-Systeme , 1993 .
[15] Klaus Neumann,et al. Heuristics for the minimum project-duration problem with minimal and maximal time lags under fixed resource constraints , 1995, J. Intell. Manuf..