A Composite Dynamic Rule for Machine Scheduling. | ||||
| MEJ- Mansoura Engineering Journal | ||||
| Article 12, Volume 31, Issue 4, December 2006, Page 17-24 PDF (996.74 K) | ||||
| Document Type: Research Studies | ||||
| DOI: 10.21608/bfemu.2021.198880 | ||||
 View on SCiNiTO | ||||
| Author | ||||
| Hassan Soltan* | ||||
| Production Engineering and Mechanical Design Department., Faculty of Engineering., El-Mansoura University., Mansoura., Egypt. | ||||
| 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 | ||||
|
Statistics Article View: 66 PDF Download: 107 |
||||
