Minimizing the number of tardy jobs in multi-period cell loading problems
暂无分享,去创建一个
[1] Gürsel A. Süer,et al. Manufacturing cell loading rules and algorithms for connected cells , 1995 .
[2] J. George Shanthikumar,et al. Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number , 1983, Comput. Oper. Res..
[3] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .
[4] Gürsel A. Süer,et al. Minimizing the number of tardy jobs in identical machine scheduling , 1993 .
[5] Donald H. Liles,et al. Planning, Design, and Analysis of Cellular Manufacturing Systems , 1995 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Johnny C. Ho,et al. Minimizing the number of tardy jobs for m parallel machines , 1995 .
[8] Gürsel A. Süer,et al. A heuristic procedure to minimize number of tardy jobs and total tardiness in single machine scheduling , 1992 .
[9] Randall P. Sadowski,et al. Cellular manufacturing control , 1983 .
[10] W. Maxwell. On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs , 1970 .
[11] Gürsel A. Süer,et al. Cell loading in cellular manufacturing systems , 1993 .
[12] Timothy J. Greene,et al. IS CELLULAR MANUFACTURING RIGHT FOR YOU , 1985 .