This paper introduces a new rule for scheduling a single machine with weighted tardiness penalties. The design of this rule is based on experimenting two efficient dispatching rules, the ATC and COVERT rules, over a wide range of their free look-ahead parameter. The proposed rule is composite and dynamic in time. Further, it replaces the look-ahead parameter with a balancing parameter which can be fixed at a value of 0.5. The computational experiments exhibit the efficiency of the proposed rule and its availability for extension. Furthermore, it can be integrated as a complementary part or other scheduling approaches of simple or complex shops.
Soltan, H. (2021). A Composite Dynamic Rule for Machine Scheduling.. MEJ- Mansoura Engineering Journal, 31(4), 17-24. doi: 10.21608/bfemu.2021.198880
MLA
Hassan Soltan. "A Composite Dynamic Rule for Machine Scheduling.". MEJ- Mansoura Engineering Journal, 31, 4, 2021, 17-24. doi: 10.21608/bfemu.2021.198880
HARVARD
Soltan, H. (2021). 'A Composite Dynamic Rule for Machine Scheduling.', MEJ- Mansoura Engineering Journal, 31(4), pp. 17-24. doi: 10.21608/bfemu.2021.198880
VANCOUVER
Soltan, H. A Composite Dynamic Rule for Machine Scheduling.. MEJ- Mansoura Engineering Journal, 2021; 31(4): 17-24. doi: 10.21608/bfemu.2021.198880
)
View on SCiNiTO