EOR 2006 - PDF Preprint Papers

EOR 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EOR-2006 Paper

click to vote

EOR
2006

199views more EOR 2006»

Short-term booking of air cargo space

14 years 13 days ago

Download www.isye.gatech.edu

This paper proposes a stochastic dynamic programming model for a short-term capacity planning model for air cargo space. The long-term cargo space is usually acquired by freight fo...

Ek Peng Chew, Huei Chuen Huang, Ellis L. Johnson, ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	199	Short-term booking of air cargo space	claim
2	178	A fuzzy optimization model for QFD planning process using analytic network approach	claim
3	148	Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection	claim
4	139	A critical-shaking neighborhood search for the yard allocation problem	claim
5	135	Principles of scatter search	claim
6	134	A smoothing heuristic for a bilevel pricing problem	claim
7	130	A Benders decomposition approach for the robust spanning tree problem with interval data	claim
8	129	Balancing assembly lines with tabu search	claim
9	128	Scatter search for project scheduling with resource availability cost	claim
10	125	A genetic algorithm for robotic assembly line balancing	claim
11	123	Double-layered dynamics: A unified theory of projected dynamical systems and evolutionary variational inequalities	claim
12	120	Approximate and exact algorithms for the fixed-charge knapsack problem	claim
13	119	Implications of personalization offers on demand and supply network design: A case from the golf club industry	claim
14	118	A random-key genetic algorithm for the generalized traveling salesman problem	claim
15	118	Multi-objective tabu search using a multinomial probability mass function	claim
16	117	Heuristics for selecting robust database structures with dynamic query patterns	claim
17	113	Validation of regression metamodels in simulation: Bootstrap approach	claim
18	110	A constructive algorithm for realizing a distance matrix	claim
19	110	Scatter search with path relinking for phylogenetic inference	claim
20	107	Longest path analysis in networks of queues: Dynamic scheduling problems	claim
21	106	Synergy analysis of collaborative supply chain management in energy systems using multi-period MILP	claim
22	106	Optimal dynamic assignment of a flexible worker on an open production line with specialists	claim
23	105	Evaluating cost taxonomies for information systems management	claim
24	104	Link function selection in stochastic multicriteria decision making models	claim
25	104	Financial networks with intermediation: Risk management with variable weights	claim
26	104	A factor 1/2 approximation algorithm for two-stage stochastic matching problems	claim
27	104	A wavelet-based spectral procedure for steady-state simulation analysis	claim
28	104	An linear programming based lower bound for the simple assembly line balancing problem	claim
29	103	Exact solutions to a class of stochastic generalized assignment problems	claim
30	97	Bayesian portfolio selection with multi-variate random variance models	claim
31	97	A simulated annealing and hill-climbing algorithm for the traveling tournament problem	claim
32	94	Portfolio rebalancing model with transaction costs based on fuzzy decision theory	claim
33	93	A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces	claim
34	91	Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming	claim
35	91	Dynamic load balancing in parallel queueing systems: Stability and optimal control	claim
36	90	A parallelizable dynamic fleet management model with random travel times	claim
37	89	Clique-detection models in computational biochemistry and genomics	claim
38	88	Nonessential objectives within network approaches for MCDM	claim
39	87	Applying machine based decomposition in 2-machine flow shops	claim
40	86	Minimum-distance controlled perturbation methods for large-scale tabular data protection	claim
41	84	A numerical study of some modified differential evolution algorithms	claim
42	83	Lower bounds and heuristic algorithms for the k	claim
43	83	The Rose-Gurewitz-Fox approach applied for patents classification	claim
44	82	Flowshop scheduling research after five decades	claim
45	81	A note on duality gap in the simple plant location problem	claim
46	81	Optimal and near-optimal policies for lost sales inventory models with at most one replenishment order outstanding	claim
47	80	Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post	claim
48	80	Applications of the urban traffic control strategy TUC	claim
49	80	Bucket brigades on in-tree assembly networks	claim
50	79	Technology choice and timing with positive network effects	claim
51	79	Equilibrium constrained optimization problems	claim
52	78	A multi-objective resource allocation problem in PERT networks	claim
53	78	A hybrid multistart heuristic for the uncapacitated facility location problem	claim
54	78	Monte Carlo analysis of convertible bonds with reset clauses	claim
55	77	A framework for ex ante project risk assessment based on absorptive capacity	claim
56	76	Load balancing and capacity constraints in a hierarchical location model	claim
57	76	Regional development assessment: A structural equation approach	claim
58	76	Location of slaughterhouses under economies of scale	claim
59	75	A rolling stock circulation model for combining and splitting of passenger trains	claim
60	74	A mixed-integer programming approach to multi-class data classification problem	claim
61	74	A set theoretic framework for enumerating matches in surveys and its application to reducing inaccuracies in vehicle roadside surveys	claim
62	74	Scheduling sports competitions at multiple venues - Revisited	claim
63	73	Enforcing minimum run length in the cutting stock problem	claim
64	73	An exact algorithm for the knapsack sharing problem with common items	claim
65	73	Path relinking and GRG for artificial neural networks	claim
66	72	Experimental tour-based travel demand models	claim
67	71	Control and optimal response problems for quasilinear impulsive integrodifferential equations	claim
68	71	Wisdom	claim
69	70	Search allocation game	claim
70	70	Heuristics for matrix bandwidth reduction	claim
71	70	Solving the p	claim
72	70	A multi-period machine assignment problem	claim
73	69	Bounds for the price of a European-style Asian option in a binary tree model	claim
74	68	Modelling complex assemblies as a queueing network for lead time control	claim
75	68	Cyclic scheduling of a 2-machine robotic cell with tooling constraints	claim
76	68	Evaluation of time-varying availability in multi-echelon spare parts systems with passivation	claim
77	66	Performance prediction of an unmanned airborne vehicle multi-agent system	claim
78	66	Multi-period capacity expansion for a local access telecommunications network	claim
79	66	Using intervals for global sensitivity and worst-case analyses in multiattribute value trees	claim
80	66	International trade and biological invasions: A queuing theoretic analysis of the prevention problem	claim
81	65	A unified heuristic for a large class of Vehicle Routing Problems with Backhauls	claim
82	65	Self-organizing maps could improve the classification of Spanish mutual funds	claim
83	65	Dynamic programming and minimum risk paths	claim
84	65	Generation of assembly graphs by systematic analysis of assembly structures	claim
85	65	A pricing model for clearing end-of-season retail inventory	claim
86	64	Optimization in Data Mining	claim
87	63	On the optimal parameter of a self-concordant barrier over a symmetric cone	claim
88	62	A hybrid genetic algorithm for the Three-Index Assignment Problem	claim
89	62	A sequential procedure for neighborhood selection-of-the-best in optimization via simulation	claim
90	62	Modeling the metrics of lean, agile and leagile supply chain: An ANP-based approach	claim
91	61	Aggregation of Malmquist productivity indexes	claim
92	61	Workload minimization in re-entrant lines	claim
93	61	Scheduling trainees at a hospital department using a branch-and-price approach	claim
94	61	Scatter Search - Wellsprings and Challenges	claim
95	59	Sensitivity analysis in linear optimization: Invariant support set intervals	claim
96	58	Bucket brigades revisited: Are they always effective?	claim
97	58	How real option disinvestment flexibility augments project NPV	claim
98	58	A survey on problems and methods in generalized assembly line balancing	claim
99	57	Routing and wavelength assignment by partition colouring	claim
100	56	A simple approximation algorithm for WIS based on the approximability in k	claim
101	52	The joint replenishment problem with resource restriction	claim
102	52	Solving feature subset selection problem by a Parallel Scatter Search	claim
103	51	A demand model with departure time choice for within-day dynamic traffic assignment	claim
104	51	The allocation of shared fixed costs	claim
105	50	Optimal product rollover strategies	claim
106	50	A dynamic programming approach to price installment options	claim
107	49	A game-theoretic formulation of joint implementation of environmental projects	claim
108	48	Locating an obnoxious plane	claim
109	48	Experimental investigation of heuristics for resource-constrained project scheduling: An update	claim
110	48	Maintenance of continuously monitored degrading systems	claim
111	48	A two threshold vacation policy in multiserver queueing systems	claim
112	48	A Bayesian paired comparison approach for relative accident probability assessment with covariate information	claim
113	47	Classes and clusters in data analysis	claim
114	46	Sequential variable sampling plan for normal distribution	claim
115	45	The evidential reasoning approach for MADA under both probabilistic and fuzzy uncertainties	claim
116	45	Rich models in discrete optimization: Formulation and resolution (ECCO XVI)	claim
117	45	Allocative efficiency of technically inefficient production units	claim
118	44	Optimal temporal product introduction strategies under valuation changes and learning	claim
119	44	Reachability cuts for the vehicle routing problem with time windows	claim
120	44	The multiple-job repair kit problem	claim
121	43	Optimal Web site reorganization considering information overload and search depth	claim
122	43	A decision support approach for the evaluation of transport investment alternatives	claim
123	40	Optimal policies for the sizing and timing of software maintenance projects	claim
124	40	A common notion of clockwise can help in planar rendezvous	claim
125	38	On the Coleman indices of voting power	claim
126	38	State-of-the-art exact and heuristic solution procedures for simple assembly line balancing	claim
127	37	Two-group classification via a biobjective margin maximization model	claim
128	35	Additive rules in discrete allocation problems	claim
129	32	A method for processing the unreliable expert judgments about parameters of probability distributions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers