An exact approach to minimize single machine total weighted tardiness problem with unequal release dates

Simple item page
buir.advisorAktürk, Selim
dc.contributor.authorÖzdemir, Deniz
dc.date.accessioned2016-01-08T20:15:55Z
dc.date.available2016-01-08T20:15:55Z
dc.date.issued1998
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 1998.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1998.en_US
dc.descriptionIncludes bibliographical references leaves 117-119en_US
dc.description.abstractIn this research, the problem of scheduling a set of jobs on a single machine to minimize total weighted tardiness with unequal release dates is considered. We present a new dominance rule by considering the time depending orderings between each pair of jobs. The proposed rule provides a sufficient condition for local optimality. Therefore, if any sequence violates the dominance rule then switching the violating jobs either lowers the total weighted tardiness or leaves it unchanged. Based on the dominance rule, an algorithm is developed which is compared to a number of heuristics in the literature. Our computational results indicate that the proposed algorithm dominates the competing algorithms in all runs, therefore it can improve the upper bounding scheme and can be used in reducing the number of alternatives in any enumerative algorithm. Furthermore, the proposed dominance rule is incorporated in a branch and bound algorithm in conjunction with lower bounding scheme, branching condition and search strcitegy. To the best of our knowledge, author know of no other published exact approach for l|rj| problem. This enhances contribution of our study in the literature.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityÖzdemir, Denizen_US
dc.format.extentxi, 120 leavesen_US
dc.identifier.urihttp://hdl.handle.net/11693/18066
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDominance Rule,en_US
dc.subjectBranch L· Bound Algorithmsen_US
dc.subjectHeuristicsen_US
dc.subjectRelease Datesen_US
dc.subjectTotal Weighted Tardinessen_US
dc.subjectSchedulingen_US
dc.subjectSingle Machineen_US
dc.subject.lccTS157.5 .O93 1998en_US
dc.subject.lcshScheduling (Management)--Mathematical models.en_US
dc.titleAn exact approach to minimize single machine total weighted tardiness problem with unequal release datesen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B043934.pdf
Size:
3.21 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Dept. of Industrial Engineering - Master's degree