NP-hardness of shop-scheduling problems with three jobs
暂无分享，去创建一个
[1] S. Akers. Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .
[2] Wlodzimierz Szwarc,et al. SOLUTION OF THE AKERS-FRIEDMAN SCHEDULING PROBLEM , 1960 .
[3] George L. Nemhauser,et al. A Geometric Model and a Graphical Algorithm for a Sequencing Problem , 1963 .
[4] William L. Maxwell,et al. Theory of scheduling , 1967 .
[5] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[6] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .
[7] Teofilo F. Gonzalez,et al. Open Shop Scheduling to Minimize Finish Time , 1976, JACM.
[8] Jan Karel Lenstra,et al. Sequencing by enumerative methods , 1977 .
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Francis Y. L. Chin,et al. Scheduling the Open Shop to Minimize Mean Flow Time , 1982, SIAM J. Comput..
[11] P. Bruckner,et al. An efficient algorithm for the job-shop problem with two jobs , 1988 .
[12] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[13] Y. Sotskov,et al. The complexity of shop-scheduling problems with two or three jobs , 1991 .
[14] N. V. Shakhlevich,et al. Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function , 1993 .
[15] V. S. Tanaev,et al. Scheduling Theory: Multi-Stage Systems , 1994 .