Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Download
Standard view
Full view
of .
Add note
Save to My Library
Sync to mobile
Look up keyword or section
Like this
1Activity
×

Table Of Contents

Introduction
1.1 Distribution in a dynamic environment
1.2 Operations Research in Supply Chain Manage-
1.3 Coordination in supply chains
1.4 A dynamic model for evaluating logistics net-
1.5 Goal and summary of the thesis
2.1 Introduction
2.2 Stochastic models and feasibility analysis
2.2.1 A general stochastic model
2.2.2 Empirical processes
2.2.3 Probabilistic feasibility analysis
2.2.4 Extension of the stochastic model
2.2.5 Asymptotically equivalent stochastic models
2.3 Heuristic solution approaches
2.3.1 A class of greedy heuristics for the CCAP
2.3.2 Improving the current solution
2.4 A set partitioning formulation
2.5 A Branch and Price scheme
2.5.1 Introduction
2.5.2 Column generation scheme
2.5.3 Branching rule
2.5.4 A special case of CCAP’s
2.5.5 The Penalized Knapsack Problem
2.6 Summary
3.1 Introduction
3.2 The model
3.3 Existing literature and solution methods
3.4 Extensions
3.5 The LP-relaxation
4.1 Introduction
4.2 Stochastic model for the GAP
4.2.1 Feasibility condition
4.2.2 Identical increasing failure rate requirements
4.3.2 Ross and Soland
4.3.3 Type C of Martello and Toth
4.3.4 Trick
4.3.5 Chalmet and Gelders
4.3.6 Racer and Amini
4.3.7 Graphical comparison
4.4 Numerical illustrations
4.4.1 Introduction
4.4.2 The solution procedure for the GAP
4.4.3 Computational results
5.1 A family of pseudo-cost functions
5.2 Geometrical interpretation
5.3 Computational complexity of finding the best
5.4 Probabilistic analysis
5.4.1 A probabilistic model
5.4.2 The optimal dual multipliers
5.4.3 A unique vector of multipliers
5.5 Numerical illustrations
5.5.1 Introduction
5.5.2 Comparison with Martello and Toth
5.5.3 Improved heuristic
6.1 Introduction
6.2 The model
6.3 Reformulation as a CCAP
6.3.1 Introduction
6.3.2 The optimal inventory costs
6.3.3 An equivalent CCAP formulation
6.4 The LP-relaxation
7.1 Introduction
7.2 Stochastic model for the MPSSP
7.3 Explicit feasibility conditions: the cyclic case
7.4 Explicit feasibility conditions: the acyclic case
7.4.1 Introduction
7.4.2 Only dynamic assignments
7.4.3 Identical facilities
7.4.4 Seasonal demand pattern
7.5 Numerical illustrations
8.1 Introduction
8.2 A family of pseudo-cost functions
8.3 A probabilistic model
8.5 Asymptotic analysis: the acyclic case
8.5.1 Introduction
8.5.2 Only dynamic customers
8.5.3 Static customers and seasonal demand pattern
8.6 Numerical illustrations
8.6.1 Introduction
8.6.2 The cyclic case
8.6.3 The acyclic case
8.6.4 The acyclic and static case
9.1 Introduction
9.2 The pricing problem for the static and seasonal
9.3 The pricing problem for the MPSSP
9.3.1 General case
9.3.2 The static case
9.3.3 Dynamic case
9.3.4 A class of greedy heuristics
9.4 Numerical illustrations
9.4.1 Introduction
9.4.2 Description of the implementation
9.4.3 Illustrations
Extensions
Additional constraints
10.1 Introduction
10.2 Throughput capacity constraints
10.2.1 Introduction
10.2.2 Reformulation as a CCAP
10.2.3 Generating experimental data
10.2.4 A class of greedy heuristics
10.2.5 A Branch and Price scheme
10.3 Physical capacity constraints
10.3.1 Introduction
10.3.2 The optimal inventory holding costs
10.3.3 Reformulation as a CCAP
10.3.4 Generating experimental data
10.3.5 A class of greedy heuristics
10.3.6 A Branch and Price scheme
10.4 Perishability constraints
10.4.1 Introduction
10.4.2 The optimal inventory holding costs
10.4.3 Reformulation as a CCAP
10.4.4 Generating experimental data
10.4.5 A class of greedy heuristics
10.4.6 A Branch and Price scheme
11.2.1 The model
11.2.2 An equivalent assignment formulation
11.2.3 The LP-relaxation
11.2.4 Generating experimental data
11.2.5 A class of greedy heuristics
11.3 Throughput capacity constraints
11.3.1 A reformulation
11.3.2 Generating experimental data
11.3.3 A class of greedy heuristics
11.4 Physical capacity constraints
11.4.1 A reformulation
11.4.2 Generating experimental data
11.4.3 A class of greedy heuristics
11.5 Perishability constraints
11.5.1 A reformulation
11.6 Numerical illustrations
0 of .
Results for:
No results containing your search query
P. 1
Book

Book

Ratings: (0)|Views: 23|Likes:
Published by 9600257003

More info:

Published by: 9600257003 on Aug 22, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See More
See less

05/17/2013

pdf

text

original

You're Reading a Free Preview
Pages 6 to 71 are not shown in this preview.
You're Reading a Free Preview
Pages 77 to 154 are not shown in this preview.
You're Reading a Free Preview
Pages 160 to 227 are not shown in this preview.
You're Reading a Free Preview
Pages 233 to 253 are not shown in this preview.
You're Reading a Free Preview
Pages 259 to 277 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->