Staff View
Operations scheduling with renewable and non-renewable resources

Descriptive

TitleInfo
Title
Operations scheduling with renewable and non-renewable resources
Name (type = personal)
NamePart (type = family)
Wang
NamePart (type = given)
Shengbin
NamePart (type = date)
1984-
DisplayForm
Shengbin Wang
Role
RoleTerm (authority = RULIB)
author
Name (type = personal)
NamePart (type = family)
Lei
NamePart (type = given)
Lei
DisplayForm
Lei Lei
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Zhao
NamePart (type = given)
Yao
DisplayForm
Yao Zhao
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Qi
NamePart (type = given)
Lian
DisplayForm
Lian Qi
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Miller
NamePart (type = given)
Tan
DisplayForm
Tan Miller
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
outside member
Name (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (type = corporate)
NamePart
Graduate School - Newark
Role
RoleTerm (authority = RULIB)
school
TypeOfResource
Text
Genre (authority = marcgt)
theses
OriginInfo
DateCreated (qualifier = exact)
2014
DateOther (qualifier = exact); (type = degree)
2014-01
Place
PlaceTerm (type = code)
xx
Language
LanguageTerm (authority = ISO639-2b); (type = code)
eng
Abstract (type = abstract)
We study a supply chain operations scheduling problem subject to both renewable and non-renewable resources. After an operation has been completed, the non-renewable resource is consumed whereas the renewable resource may be resumed for the next operation. Of both the renewable and the non-renewable resources, limited amounts are available and they need to be delivered to the locations where they are needed. The operations have deadlines, and the availability of the renewable resources depends on the sequence of the operations. Our problem is to find a coordinated operations schedule for the non-renewable and renewable resources so that the total tardiness across all the customers in the given network is minimized. Part 1 of this dissertation presents an overview of existing solution methodologies for integrated supply chain operations scheduling/planning problems involving production, inventory, distribution, and routing. We take into account problems dealing with operational decisions and classify them according to their characteristics, such as time constraints and routing decisions that are directly related to our research problem. Various methodologies are presented and discussed, and their possible integrations, combinations, and extensions are discussed. In Part 2 of the dissertation, we build a mixed integer-programming model, present a complexity classification for our problem, and show where the borderline lies between NP-Hardness and polynomial time solvability. We analyze the structural properties of our problem, provide strongly polynomial-time solutions for several special cases that have practical applications, and identify the cases that are computationally intractable. Finally, we propose a framework of heuristic procedures for solving more general versions of this problem. In Part 3 of this study, we introduce a mathematical programming based rolling horizon heuristic that is able to locate near optimal solutions within ten-minute of CPU time for networks up to 80 customer service operations. This heuristic solves the problem through an iterative process. In each iteration, a subset of customers and a subset of batches of non-renewable resources, together with the travel teams (renewable resources), are scheduled by solving a respective optimization problem of a much smaller size. Through an extensive empirical study with over 5,000 randomly generated test cases under various parameters, the empirical error gaps of this proposed solution approach, when compared to the best solution obtained by a commercial optimizer within one-hour of CPU time, are constantly within 5%. This work can be extended in several directions. One of them is to conduct a thorough simulation study to assess the impact of management policies on the effectiveness of emergency logistics involving bottleneck renewable and non-renewable resources. Another one is to design and evaluate meta-heuristics for solving a more general version of our problem.
Subject (authority = RUETD)
Topic
Management
Subject (authority = ETD-LCSH)
Topic
Operations research
Subject (authority = ETD-LCSH)
Topic
Management--Simulation methods
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
Identifier
ETD_5229
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
xi, 179 p. : ill.
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = vita)
Includes vita
Note (type = statement of responsibility)
by Shengbin Wang
Subject (authority = ETD-LCSH)
Topic
Business logistics
RelatedItem (type = host)
TitleInfo
Title
Graduate School - Newark Electronic Theses and Dissertations
Identifier (type = local)
rucore10002600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3KP808W
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder (type = personal)
Name
FamilyName
Wang
GivenName
Shengbin
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2013-12-19 10:56:18
AssociatedEntity
Name
Shengbin Wang
Role
Copyright holder
Affiliation
Rutgers University. Graduate School - Newark
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
ETD
OperatingSystem (VERSION = 5.1)
windows xp
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2021