A new dominance rule to minimize total weighted tardiness on a single machine

Simple item page
buir.advisorAktürk, M. Selim
dc.contributor.authorYıldırım, Mehmet Bayram
dc.date.accessioned2016-01-08T20:13:51Z
dc.date.available2016-01-08T20:13:51Z
dc.date.issued1996
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 1996.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1996.en_US
dc.descriptionIncludes bibliographical references leaves 75-79en_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, i.e. if any sequence violates the dominance rule, switching a violating job either lowers the total weighted tardiness or leaves it unchanged. We introduce an 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 over •30000 problems indicate that the proposed algorithm dominates the competing heuristics in all runs. Furthermore, the new dominance rules can be used in reducing the number of alternatives for finding the optimal solution in complete enumeration techniques. We show that the proposed dominance rule increases the number of global dominance relationships generated by the Emmons’ Rule which is used heavily in literature to restrict the search space. We also show that having a better upper bound value usually improves the lower bound value which is obtained from the linear lower bound.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityYıldırım, Mehmet Bayramen_US
dc.format.extentxi, 80 leavesen_US
dc.identifier.urihttp://hdl.handle.net/11693/17834
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDominance Rulesen_US
dc.subjectHeuristicsen_US
dc.subjectLower Boundsen_US
dc.subjectSingle Machine Schedulingen_US
dc.subjectUpper Boundsen_US
dc.subject.lccTS157.5 .Y45 1996en_US
dc.subject.lcshScheduling (Management)--Mathematic models.en_US
dc.titleA new dominance rule to minimize total weighted tardiness on a single machineen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B034353.pdf
Size:
2.2 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Dept. of Industrial Engineering - Master's degree