This paper addresses the single-machine scheduling problem with release times minimizing the total completion time. Under the circumstance of incomplete global information at each decision time, a two-level rolling sc...This paper addresses the single-machine scheduling problem with release times minimizing the total completion time. Under the circumstance of incomplete global information at each decision time, a two-level rolling scheduling strategy (TRSS) is presented to create the global schedule step by step. The estimated global schedules are established based on a dummy schedule of unknown jobs. The first level is the preliminary scheduling based on the predictive window and the second level is the local scheduling for sub-problems based on the rolling window. Performance analysis demonstrates that TRSS can improve the global schedules. Computational results show that the solution quality of TRSS outperforms that of the existing rolling procedure in most cases.展开更多
基金Supported by National Natural Science Foundation of P.R. China (60274013, 60474002)Shanghai Development Foundation for Science and Technology (04DZ11008)Science Research Foundation of Shandong University at Weihai (XZ2005001)
文摘This paper addresses the single-machine scheduling problem with release times minimizing the total completion time. Under the circumstance of incomplete global information at each decision time, a two-level rolling scheduling strategy (TRSS) is presented to create the global schedule step by step. The estimated global schedules are established based on a dummy schedule of unknown jobs. The first level is the preliminary scheduling based on the predictive window and the second level is the local scheduling for sub-problems based on the rolling window. Performance analysis demonstrates that TRSS can improve the global schedules. Computational results show that the solution quality of TRSS outperforms that of the existing rolling procedure in most cases.
