Showing 1 - 10 of 59
The choice network revenue management (RM) model incorporates customer purchase behavior as customers purchasing products with certain probabilities that are a function of the offered assortment of products, and is the appropriate model for airline and hotel network revenue management, dynamic...
Persistent link: https://www.econbiz.de/10010849604
The choice network revenue management model incorporates customer purchase behavior as a function of the offered products, and is the appropriate model for airline and hotel network revenue management, dynamic sales of bundles, and dynamic assortment optimization. The optimization problem is a...
Persistent link: https://www.econbiz.de/10010849611
The network revenue management (RM) problem arises in airline, hotel, media, and other industries where the sale products use multiple resources. It can be formulated as a stochastic dynamic program but the dynamic program is computationally intractable because of an exponentially large state...
Persistent link: https://www.econbiz.de/10009650740
Models incorporating more realistic models of customer behavior, as customers choosing from an offer set, have recently become popular in assortment optimization and revenue management. The dynamic program for these models is intractable and approximated by a deterministic linear program called...
Persistent link: https://www.econbiz.de/10009493743
This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.
Persistent link: https://www.econbiz.de/10005704871
We propose a model and solution methods, for locating a fixed number of multiple-server, congestible common service centers or congestible public facilities. Locations are chosen so to minimize consumers’ congestion (or queuing) and travel costs, considering that all the demand must be served....
Persistent link: https://www.econbiz.de/10005704918
In this paper we propose a metaheuristic to solve a new version of the Maximum Capture Problem. In the original MCP …
Persistent link: https://www.econbiz.de/10005704944
The Generalized Assignment Problem consists in assigning a set of tasks to a set of agents with minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the resource of the agent. We present new...
Persistent link: https://www.econbiz.de/10005704984
The need for integration in the supply chain management leads us to consider the coordination of two logistic planning functions: transportation and inventory. The coordination of these activities can be an extremely important source of competitive advantage in the supply chain management. The...
Persistent link: https://www.econbiz.de/10005707973
The standard one-machine scheduling problem consists in scheduling a set of jobs in one machine which can handle only one job at a time, minimizing the maximum lateness. Each job is available for processing at its release date, requires a known processing time and after finishing the processing,...
Persistent link: https://www.econbiz.de/10005707986