Minimizing tardy jobs in a flowshop with common due date
暂无分享,去创建一个
[1] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[2] R. A. Dudek,et al. Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .
[3] Gilbert Laporte,et al. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..
[4] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[5] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .
[6] Chris N. Potts,et al. A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop , 1989 .
[7] Wieslaw Kubiak,et al. Scheduling shops to minimize the weighted number of late jobs , 1994, Oper. Res. Lett..
[8] Jatinder N. D. Gupta. M-stage scheduling problem—a critical appraisal , 1971 .
[9] Jatinder N. D. Gupta,et al. Flowshop scheduling with dominant machines , 1995, Comput. Oper. Res..
[10] Jatinder N. D. Gupta,et al. Two-machine flowshop scheduling to minimize the number of tardy jobs , 1997 .
[11] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .