Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems

MISSING IMAGE

Material Information

Title:
Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems
Physical Description:
1 online resource (22 p.)
Language:
english
Creator:
Tadayon, Bita
Publisher:
University of Florida
Place of Publication:
Gainesville, Fla.
Publication Date:

Thesis/Dissertation Information

Degree:
Doctorate ( Ph.D.)
Degree Grantor:
University of Florida
Degree Disciplines:
Industrial and Systems Engineering
Committee Chair:
SMITH,JONATHAN COLE
Committee Co-Chair:
GEUNES,JOSEPH PATRICK
Committee Members:
GUAN,YONGPEI
RANKA,SANJAY

Subjects

Subjects / Keywords:
budgeted-uncertainty -- complexity-analysis -- congestion -- cutting-planes -- dynamic-programming -- integer-programming -- linearization -- multicommodity-flow -- network-optimization -- node-reliabilities -- robust-optimization -- scheduling -- single-machine -- uncertainty
Industrial and Systems Engineering -- Dissertations, Academic -- UF
Genre:
Industrial and Systems Engineering thesis, Ph.D.
bibliography   ( marcgt )
theses   ( marcgt )
government publication (state, provincial, terriorial, dependent)   ( marcgt )
born-digital   ( sobekcm )
Electronic Thesis or Dissertation

Notes

Abstract:
We address several optimization problems in which data elements are uncertain. For each problem we apply an appropriate method for uncertainty representation, propose efficient mathematical formulations, and present solution methods. We first consider the problem of sending a set of multiple commodities from their origin to destination nodes via intermediate hubs (multicommodity network flow problem). We assume that each hub node is associated with a reliability function, which depends on the total flow that crosses that hub. The probability that each commodity is successfully relayed from its origin to its destination is given by the product of hub reliabilities on the commodity's path. The problem we consider seeks to find minimum-cost commodity paths such that each commodity reaches its destination with a sufficiently large probability. We first formulate the problem as a nonlinear multicommodity network flow problem and prove that it is strongly NP-hard. We then present two linearization techniques for this formulation, and propose a pair of lower- and upper-bounding formulations, which can then be used within an exact cutting-plane algorithm to solve the problem. Finally, we analyze the computational effectiveness of our proposed strategies on a set of randomly generated instances. As our second line of research we consider the group of single-machine scheduling problems with uncertainty in their parameter values. In particular we focus on robust optimization as an appropriate method of dealing with uncertainty in several scheduling environments. We fist present a comprehensive survey of robust single-machine scheduling problems, classify the literature, and introduce open problems in this area. As the output of this survey we propose the possibility of improving existing robust scheduling models by applying recent developments in robust optimization in this area. Accordingly, as the next step of our research we study a robust single-machine scheduling problem where job processing times are subject to uncertainty with their values belonging to independent continuous intervals. We consider four alternative optimization criteria and apply state-of-the-art robust optimization methods to define three different uncertainty sets. We then explore the problem of determining the worst-case scenario (set of job processing times) corresponding to a given job schedule and objective. We then analyze the problem of scheduling jobs to minimize the worst-case objective, given each combination of objective and uncertainty set.
General Note:
In the series University of Florida Digital Collections.
General Note:
Includes vita.
Bibliography:
Includes bibliographical references.
Source of Description:
Description based on online resource; title from PDF title page.
Source of Description:
This bibliographic record is available under the Creative Commons CC0 public domain dedication. The University of Florida Libraries, as creator of this bibliographic record, has waived all rights to it worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
Statement of Responsibility:
by Bita Tadayon.
Thesis:
Thesis (Ph.D.)--University of Florida, 2014.
Local:
Adviser: SMITH,JONATHAN COLE.
Local:
Co-adviser: GEUNES,JOSEPH PATRICK.
Electronic Access:
RESTRICTED TO UF STUDENTS, STAFF, FACULTY, AND ON-CAMPUS USE UNTIL 2014-11-30

Record Information

Source Institution:
UFRGP
Rights Management:
Applicable rights reserved.
Classification:
lcc - LD1780 2014
System ID:
UFE0046568:00001