A new dominance rule for the total weighted tardiness problem

dc.citation.epage149en_US
dc.citation.issueNumber2en_US
dc.citation.spage138en_US
dc.citation.volumeNumber10en_US
dc.contributor.authorAktürk, M. S.en_US
dc.contributor.authorYıldırım, M. B.en_US
dc.date.accessioned2016-02-08T10:41:49Z
dc.date.available2016-02-08T10:41:49Z
dc.date.issued1999en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a sufficient condition for local optimality. We show that if any sequence violates the dominance rule, then switching the violating jobs either lowers the total weighted tardiness or leaves it unchanged. We also develop a new algorithm based on the dominance rule, which is compared to a number of competing heuristics for a set of randomly generated problems. Our computational results of over 40000 problems indicate that the proposed algorithm dominates the competing heuristics in all runs.en_US
dc.identifier.doi10.1080/095372899233299en_US
dc.identifier.issn0953-7287
dc.identifier.urihttp://hdl.handle.net/11693/25262
dc.language.isoEnglishen_US
dc.publisherTaylor & Francisen_US
dc.relation.isversionofhttps://doi.org/10.1080/095372899233299en_US
dc.source.titleProduction Planning and Controlen_US
dc.subjectHeuristicsen_US
dc.subjectSchedulingen_US
dc.subjectWeighted tardinessen_US
dc.subjectAlgorithmsen_US
dc.subjectHeuristic methodsen_US
dc.subjectOptimizationen_US
dc.subjectProblem solvingen_US
dc.subjectRandom processesen_US
dc.subjectDominance ruleen_US
dc.subjectJust in time productionen_US
dc.titleA new dominance rule for the total weighted tardiness problemen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
A new dominance rule for the total weighted tardiness problem.pdf
Size:
831.65 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version