A Mathematical Model for Periodic Scheduling Problems
暂无分享,去创建一个
[1] Jan Karel Lenstra,et al. Sequencing and scheduling : an annotated bibliography , 1997 .
[2] Gary L. Miller,et al. The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.
[3] James B. Orlin,et al. Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets , 1982, Oper. Res..
[4] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[5] I. Gertsbach,et al. Constructing an Optimal Fleet for a Transportation Schedule , 1977 .
[6] Paolo Serafini,et al. An approach towards solving periodic scheduling problems , 1985 .
[7] W. Hsu. On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine , 1983 .
[8] D. P. Bovet,et al. An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs , 1981 .
[9] Harold S. Stone,et al. The Average Complexity of Depth-First Search with Backtracking and Cutoff , 1986, IBM J. Res. Dev..
[10] A. Barrett. Network Flows and Monotropic Optimization. , 1984 .