Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
暂无分享,去创建一个
[1] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[2] Robin Roundy. Cyclic Schedules for Job Shops with Identical Jobs , 1992, Math. Oper. Res..
[3] E. Pinson. Le probleme de job-shop , 1988 .
[4] Alix Munier,et al. Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources , 1991 .
[5] Monica Sin-Ling Lam,et al. A Systolic Array Optimizing Compiler , 1989 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Christine Eisenbeis. Optimization of horizontal microcode generation for loop structures , 1988, ICS '88.
[8] Walter Ukovich,et al. A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..
[9] Alexander Aiken,et al. Optimal loop parallelization , 1988, PLDI '88.
[10] Jacques Carlier,et al. Les problèmes d'ordonnancement , 1993 .
[11] J. Quadrat,et al. A linear-system-theoretic view of discrete-event processes , 1983, The 22nd IEEE Conference on Decision and Control.
[12] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[13] Hirofumi Matsuo. Cyclic sequencing problems in the two‐machine permutation flow shop: Complexity, worst‐case, and average‐case analysis , 1990 .
[14] Peter M. Kogge,et al. The Architecture of Pipelined Computers , 1981 .