Table of Contents Table of Contents
Previous Page  206 / 561 Next Page
Information
Show Menu
Previous Page 206 / 561 Next Page
Page Background

INFORMS Nashville – 2016

206

MC70

Acoustic- Omni

Transportation, Maritime III

Contributed Session

Chair: Liliana Delgado Hidalgo, Doctoral Candidate, University of

Arkansas and Universidad del Valle, 4207 Bell Engineering Center,

Fayetteville, AR, 72701, United States,

ld002@uark.edu

1 - A Constraint Programming Approach For A Parallel Machine

Scheduling Problem With Time Intervals And Sequence

Dependent Setup Times

Ridvan Gedik, University of New Haven, 300 Boston Post Rd,

Buckman Hall 223 F, West Haven, CT, 06516, United States,

rgedik@newhaven.edu

, Chase Rainwater

In this study, we introduce a scheduling problem that aims to minimize the

makespan of jobs on unrelated machines subject to time availability intervals and

sequence dependent setup times in a fixed planning horizon. Computational tests

on a real-life case study prepared in collaboration with the U.S. Army Corps of

Engineers (USACE) show that the constraint programming model outperforms

the mixed integer programming model in terms of solution time and quality. In

addition, sensitivity analysis conducted on time interval restrictions provide

decision makers with quantitative insights into how much savings might be

obtained if these were relaxed.

2 - A Rolling Horizon Approach For Integrated Yard Crane Scheduling

And Container Handling In A Stochastic Environment

Filip Covic, PhD Student, Institute for Operations Research,

University of Hamburg, Von-Melle-Park 5, Hamburg, 20146,

Germany,

filip.covic@uni-hamburg.de,

Mehdi Karimi-Nasab

A container terminal with multiple blocks, each operated by a yard crane is

considered. A mixed-integer model is developed for integrating following

operational sub-problems: crane scheduling, container storage allocation,

relocation and re-marshaling. The objective function is to minimize the total

weighted number of shuffle and re-marshaling moves. A rolling horizon

framework is used to deal with uncertainty of container arrival and retrieval

times. Within this framework, these data are periodically updated according to

available berthing and truck arrival times. In each period the time capacity of the

crane is limited. A solution approach to exploit the decompsoable sturcture is

applied.

3 - Simulation Approach For A Container Terminal, A Case Study

Nabil Nehme, Assistant Professor, Lebanese American University,

Ramlet El- Baida, Thomas Edison Street, Beirut, Lebanon,

nehme_nabil@hotmail.com,

Faten Abou Shakra, Clovis Francis

This research investigates the tactical operations inside a container terminal. The

case of Beirut Container Terminal (BCT) is considered. A simulation model is

developed to reflect the current state of BCT and existing berthing problems. Both

qualitative and quantitative data are collected. Several scenarios are tested to

minimize the queue for berthing vessels. A strategic work policy is suggested to

leverage competition taking into consideration financial and operational

constraints.

4 - Barge Assignment And Scheduling During Inland Waterway

Disruption Response

Liliana Delgado Hidalgo, Doctoral Candidate, University of

Arkansas and Universidad del Valle, 4207 Bell Engineering Center,

Fayetteville, AR, 72701, United States,

ld002@uark.edu,

Heather Nachtmann

We study the problem of assigning and scheduling barges to terminals during

inland waterway disruption response. The problem is formulated as a

heterogeneous vehicle routing problem with time windows that minimizes total

value loss. We present an improvement to the initial formulation by adding valid

inequalities. Several disruption instances are solved, comparing our approach

with prior work in this area and resulting in improved results.

MC71

Electric- Omni

Supply Chain, Shipping III

Contributed Session

Chair: Umit Saglam, Assistant Professor, East Tennessee State

University, East Tennessee State University, PO Box 70625, Johnson

City, TN, 37614, United States,

saglam@etsu.edu

1 - Application Of Service Industry In Port Management

Maryam Hamidi, University of Arizona, 3121 E Bellevue Street,

Unit 2, Tucson, AZ, 85716, United States,

mhamidi@email.arizona.edu

In this presentation, we will study the port management and supply chain in

maritime.

2 - Centralized And Decentralized Warehouse Logistics With

Stochastic Demand Collaboration

Shiman Ding, University of California Berkeley, Berkeley, CA,

94706, United States,

shiman@berkeley.edu

, Philip Kaminsky

An emerging paradigm for horizontal logistics collaboration in the grocery

industry involves the use of large third-party warehouses used by suppliers as

outbound warehouses, and by retailers as distribution centers. We model a setting

where safety stock is maintained at both the warehouse and retailers, and build

on our previous work for a deterministic version of this problem to develop a

heuristic for this model with a worst-case bound of 1.19. We also develop

effective heuristics for decentralized versions of this model, and finally, we

characterize the “cost of anarchy” in this system - the loss due to decentralized

operation.

3 - A Change Of Gear: Managing Modal Split Transport (mst)

Chuanwen Dong, Kuehne Logistics University, Grosser Grasbrook

17, Hamburg, 20457, Germany,

chuanwen.dong@the-klu.org

,

Sandra Transchel, Stefan Minner

The truck driver shortage rises freight cost and erodes firms’ SC margins. We

study a MST policy to shift volume to trains. We model the two modes differently

based on their nature: a train has a fixed schedule over a long period and requires

stable deliveries. The economics of scale in rail freight cost and inventory

mismatch cost is also incorporated. The model is solved via Stochastic DP

optimally for: the fixed load and delivery frequency of the train, and the delivery

policy of the truck. Real data application shows considerably modal shift into

trains, and suggests the firm the favorable products for MST.

4 - Multiproduct Batch Production And Truck Shipment Scheduling

Under Different Shipping Policies

Umit Saglam, Assistant Professor, East Tennessee State University,

East Tennessee State University Department of Management and

Marketing, PO Box 70625, Johnson City, TN, 37614, United States,

saglam@etsu.edu

In this paper, we formulate mathematical models that attempt to integrate the

production lot scheduling problem with outbound shipment decisions. The

optimization objective is to minimize the total relevant costs of a manufacturer,

which distributes a set of products to multiple retailers. In making the

production/distribution decisions, the common cycle approach is employed to

solve the ELSP, for simplicity. The resulting mixed-integer, non-linear

programming models (MINLPs) are solved by the BONMIN solver. Finally, a set of

numerical examples illustrate and evaluate the relative efficacies of these policies.

MC72

Bass- Omni

Supply Chain Mgt VII

Contributed Session

Chair: Turgut Aykin, Managing Member, Aykin Associates,

136 Buckmanville Rd., New Hope, PA, 18938, United States,

taykin@aykinassociates.com

1 - Robust Supply Chain System Under Yield Uncertainty

Samir A Alsobhi, Assistant Professor, Yanbu University College,

Yanbu Alsinaiyah, 51000, Saudi Arabia,

Alsobhis@rcyci.edu.sa

,

Krishna Krishnan

Products are often damaged in transit.These damages are stochastic in

nature.To

minimize the impact of damage,the selection of routes should consider not only

the expected damage but also the variability of

damage.In

this research,the first

model is of the supply chain network in order to minimize total cost,which

consists of product cost and transportation cost while considering multiple routes

and

products.In

the second model,the concept of robust design has been applied

to minimize damage.

2 - A Location Allocation Model For Facility Planning To Minimize The

Operational Cost

Damitha Bandara, Assistant Professor, Albany State University,

504 College Dr, Albany, GA, 31705, United States,

damitha.bandara@asurams.edu

Locating and allocating distribution centers optimally is a crucial and systematic

task for decision-makers. Optimally located distribution centers can significantly

improve the logistics system’s efficiency and reduce its operational costs. In this

research, we develop a mathematical model to determine the optimal locations

and allocations for distribution centers that minimizes the operational cost. The

model is used to find the optimal location and allocation of distributions centers

for a leading company in the USA. Computational results show that the company

can reduce their operational cost significantly by implementing new optimal

distribution locations.

MC70