Due-date assignment and single machine scheduling with compressible processing times
暂无分享,去创建一个
T.C.E. Cheng | Ceyda Oguz | X. D. Qi | T. Cheng | X. Qi | C. Oğuz
[1] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[2] Raymond G. Vickson,et al. Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .
[3] T.C.E. Cheng,et al. Resource optimal control in some single-machine scheduling problems , 1994, IEEE Trans. Autom. Control..
[4] Chung-Lun Li,et al. Parallel-machine scheduling with controllable processing times , 1996 .
[5] Stanisaw Zdrzaka,et al. Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis , 1991 .
[6] Rakesh K. Sarin,et al. Technical Note - Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy , 1989, Oper. Res..
[7] K. R. Baker,et al. A bicriterion approach to time/cost trade-offs in sequencing , 1982 .
[8] S. S. Panwalkar,et al. Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..
[9] R. G. Vickson,et al. Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..
[10] S. S. Panwalkar,et al. Single-machine sequencing with controllable processing times , 1992 .
[11] T.C.E. Cheng,et al. Survey of scheduling research involving due date determination decisions , 1989 .
[12] Eugeniusz Nowicki,et al. A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..
[13] Bahram Alidaee,et al. Two parallel machine sequencing problems involving controllable job processing times , 1993 .
[14] Stanisław Zdrzałka,et al. A two-machine flow shop scheduling problem with controllable job processing times , 1988 .