Minimizing schedule length on identical parallel machines: an exact algorithm

Simple item page
buir.advisorBenli, Ömer S.
dc.contributor.authorAkyel, H. Cemal
dc.date.accessioned2016-01-08T20:19:29Z
dc.date.available2016-01-08T20:19:29Z
dc.date.issued1991
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent Univ., 1991.en_US
dc.descriptionThesis (Ph. D.) -- Bilkent University, 1991.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.abstractThe primary concern of this study is to investigate the combinatorial aspects of the single-stage identical parallel machine scheduling problem and to develop a computationally feasible branch and bound algorithm for its exact solution. Although there is a substantial amount of literature on this problem, most of the work in this area is on the development and performance analysis of approximation algorithms. The few optimizing algorithms proposed in the literature have major drawbacks from the computer implementation point of view. Even though the single-stage scheduling problem is known to be unary A/’P-hard, there is still a need to develop a computationally feasible optimizing algorithm that solves the problem in a reasonable time. Development of such an algorithm is necessary for solving the multi-stage parallel machine scheduling problems which are currently an almost untouched issue in the deterministic scheduling theory. In this study, a branch and bound algorithm for the single-stage identical parallel machine scheduling problem is proposed. Promising results were obtained in the empirical analysis of the performance of this algorithm. Furthermore, the procedure that is developed to determine tight bounds at a node of the enumeration tree, is an approximation algorithm that solves a special class of identical parallel machine scheduling problems of practical interest. This algorithm delivers a solution that is arbitrarily close to 4/3 times the optimum. To our knowledge this is the best result obtained for this problem so far.en_US
dc.description.degreePh.D.en_US
dc.description.statementofresponsibilityAkyel, H Cemalen_US
dc.format.extentxii, 123 leavesen_US
dc.identifier.urihttp://hdl.handle.net/11693/18453
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDeterministic machine schedulingen_US
dc.subjectIdentical parallel machinesen_US
dc.subjectMinimizing makespanen_US
dc.subjectComputational complexity theoryen_US
dc.subjectApproximation algorithmsen_US
dc.subjectOptimizing algorithmsen_US
dc.subjectPerformance boundsen_US
dc.subject.lccT157.5 .A39 1991en_US
dc.subject.lcshProduction schedulingen_US
dc.subject.lcshScheduling (Management)en_US
dc.subject.lcshParallel computersen_US
dc.subject.lcshComputer algorithmsen_US
dc.titleMinimizing schedule length on identical parallel machines: an exact algorithmen_US
dc.typeThesisen_US

Files

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

Collections

Dept. of Industrial Engineering - Ph.D. / Sc.D.