Yaman, Hande2016-01-082016-01-081999http://hdl.handle.net/11693/18114Ankara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1999.Thesis (Master's) -- Bilkent University, 1999.Includes bibliographical references leaves 84-85In this study, we investigate three well-known problems, the longest path problem on directed acyclic graphs, the minimum spanning tree problem and the single machine scheduling problem with total flow time criterion, where the input data for all problems are given as interval numbers. Since optimal solutions depend on the realization of the data, we define new optimality concepts to aid decision making. VVe present characterizations for these “optimal” solutions and suggest polynomial time algorithms to find them in some special cases.xi, 85 leaves, illustrationsEnglishinfo:eu-repo/semantics/openAccessLongest Path Problem on Directed Acyclic GraphsPolynomial Time AlgorithmsInterval DataSingle Machine Scheduling Problem with Total Flow Time CriterionMinimum Spanning Tree ProblemQA402.5 .Y36 1999Combinatorial optimization.Interval analysis (Mathematics).Thesis