Subject Area
Mechanical Power Engineering
Article Type
Original Study
Abstract
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.
Keywords
Scheduling; Dispatching rules; Weighted Tardiness
Recommended Citation
Soltan, Hassan
(2021)
"A Composite Dynamic Rule for Machine Scheduling.,"
Mansoura Engineering Journal: Vol. 31
:
Iss.
4
, Article 12.
Available at:
https://doi.org/10.21608/bfemu.2021.198880