Academic Journal
A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem.
| Τίτλος: | A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem. |
|---|---|
| Συγγραφείς: | Martins, Ana Sofia M., Valente, Jorge M. S., Schaller, Jeffrey E. |
| Πηγή: | International Transactions in Operational Research; Nov2026, Vol. 33 Issue 6, p3882-3904, 23p |
| Θεματικοί όροι: | Scheduling, Production scheduling, Benchmark testing (Engineering), Benchmark problems (Computer science), Heuristic |
| Περίληψη: | This paper considers the single machine total weighted tardiness problem. A thorough computational evaluation of new and existing dispatching rules is performed. We considered several existing heuristics and proposed new backward rules. These procedures are analyzed together for the first time and coded in the same programming language. We also created a new and much larger dataset, which allows a more detailed comparison and provides a useful benchmark for future work. We first conducted preliminary tests to determine appropriate parameter values and to choose between three versions of the new rules. These tests showed a need to use instance characteristics to make better choices. We then analyzed the heuristics and identified the non‐dominated procedures, considering solution quality and computational time. One of the new backward rules is non‐dominated, achieving the best solution quality. The non‐dominated set allows decision‐makers to choose a procedure depending on problem size and available time. [ABSTRACT FROM AUTHOR] |
| Copyright of International Transactions in Operational Research is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Complementary Index |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://www.doi.org/10.1111/itor.70146? Name: ScienceDirect (all content) (s7799221) Category: fullText Text: View record from ScienceDirect MouseOverText: View record from ScienceDirect – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:edb&genre=article&issn=09696016&ISBN=&volume=33&issue=6&date=20261101&spage=3882&pages=3882-3904&title=International Transactions in Operational Research&atitle=A%20computational%20evaluation%20of%20new%20and%20existing%20dispatching%20rules%20for%20the%20single%20machine%20total%20weighted%20tardiness%20problem.&aulast=Martins%2C%20Ana%20Sofia%20M.&id=DOI:10.1111/itor.70146 Name: Full Text Finder (for New FTF UI) (ns324271) Category: fullText Text: Full Text Finder MouseOverText: Full Text Finder |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 194403207 RelevancyScore: 1067 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1066.68505859375 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Martins%2C+Ana+Sofia+M%2E%22">Martins, Ana Sofia M.</searchLink><br /><searchLink fieldCode="AR" term="%22Valente%2C+Jorge+M%2E+S%2E%22">Valente, Jorge M. S.</searchLink><br /><searchLink fieldCode="AR" term="%22Schaller%2C+Jeffrey+E%2E%22">Schaller, Jeffrey E.</searchLink> – Name: TitleSource Label: Source Group: Src Data: International Transactions in Operational Research; Nov2026, Vol. 33 Issue 6, p3882-3904, 23p – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Scheduling%22">Scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Benchmark+testing+%28Engineering%29%22">Benchmark testing (Engineering)</searchLink><br /><searchLink fieldCode="DE" term="%22Benchmark+problems+%28Computer+science%29%22">Benchmark problems (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic%22">Heuristic</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This paper considers the single machine total weighted tardiness problem. A thorough computational evaluation of new and existing dispatching rules is performed. We considered several existing heuristics and proposed new backward rules. These procedures are analyzed together for the first time and coded in the same programming language. We also created a new and much larger dataset, which allows a more detailed comparison and provides a useful benchmark for future work. We first conducted preliminary tests to determine appropriate parameter values and to choose between three versions of the new rules. These tests showed a need to use instance characteristics to make better choices. We then analyzed the heuristics and identified the non‐dominated procedures, considering solution quality and computational time. One of the new backward rules is non‐dominated, achieving the best solution quality. The non‐dominated set allows decision‐makers to choose a procedure depending on problem size and available time. [ABSTRACT FROM AUTHOR] – Name: Abstract Label: Group: Ab Data: <i>Copyright of International Transactions in Operational Research is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=194403207 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1111/itor.70146 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 23 StartPage: 3882 Subjects: – SubjectFull: Scheduling Type: general – SubjectFull: Production scheduling Type: general – SubjectFull: Benchmark testing (Engineering) Type: general – SubjectFull: Benchmark problems (Computer science) Type: general – SubjectFull: Heuristic Type: general Titles: – TitleFull: A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Martins, Ana Sofia M. – PersonEntity: Name: NameFull: Valente, Jorge M. S. – PersonEntity: Name: NameFull: Schaller, Jeffrey E. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 09696016 Numbering: – Type: volume Value: 33 – Type: issue Value: 6 Titles: – TitleFull: International Transactions in Operational Research Type: main |
| ResultId | 1 |