Similar Search Results

Subjective Expectations Equilibrium in Economies with Uncertain Delivery

Correia-da-Silva, Joao; Hervés-Beloso, Carlos - Faculdade de Economia, Universidade do Porto - 2005

In economies with uncertain delivery, agents trade their endowments for lists instead of bundles. A list specifies a set of bundles such that the agent has the right to receive one of them. In this paper, with continuity conditions on private beliefs about the bundle that will be delivered, we...

Persistent link: https://www.econbiz.de/10005059533

Prudent Expectations Equilibrium in Economies with Uncertain Delivery

Correia-da-Silva, Joao; Hervés-Beloso, Carlos - Faculdade de Economia, Universidade do Porto - 2006

In an economy with private information, we introduce the notion of objects of choice as lists of bundles out of which the market selects one for delivery. This leads to an extension of the model of Arrow-Debreu that is used to study ex-ante trade with private state verification. The model does...

Persistent link: https://www.econbiz.de/10005059556

Solving Concave Network Flow Problems

Monteiro, Marta S.R.; Fontes, Dalila B.M.M.; Fontes, … - Faculdade de Economia, Universidade do Porto - 2012

The Minimum Cost Network Flow Problem (MCNFP) includes a wide range of combinatorial optimization problems. Many applications exist for MCNFPs for instance supply chains, logistics, production planning, communications and transportations. Concave costs are, in many applications, more realistic...

Persistent link: https://www.econbiz.de/10010842594

Restructuring Facility Networks under Economy of Scales

Monteiro, Marta Sofia R.; Fontes, Dalila B. M. M.; … - Faculdade de Economia, Universidade do Porto - 2009

In this work we address the facility network restructuring problem. This problem is closely related to location/allocation and set covering problems. However, none of the above includes all its complexity nor involves all the decision types. Due to the presence of economies of scale, another...

Persistent link: https://www.econbiz.de/10005006741

Beam search heuristics for quadratic earliness and tardiness scheduling

Valente, Jorge M. S. - Faculdade de Economia, Universidade do Porto - 2008

In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and … tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and … recovering algorithms. We consider three dispatching heuristics as evaluation functions, in order to analyse the effect of …

Persistent link: https://www.econbiz.de/10005059449

Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs

Valente, Jorge M. S. - Faculdade de Economia, Universidade do Porto - 2007

computational results show that using better rules indeed improves the performance of the beam search heuristics. The detailed …

Persistent link: https://www.econbiz.de/10005059475

Heuristics for the single machine scheduling problem with early and quadratic tardy penalties

Valente, Jorge M. S. - Faculdade de Economia, Universidade do Porto - 2006

, and no machine idle time. We propose several dispatching heuristics, and analyse their performance on a wide range of … instances. The heuristics include simple scheduling rules, as well as a procedure that takes advantage of the strengths of these … were performed to determine appropriate values for the parameters required by some of the heuristics. The computational …

Persistent link: https://www.econbiz.de/10005059481

Improved Heuristics for the Early/Tardy Scheduling Problem with No Idle Time

Valente, Jorge M. S.; Alves, Rui A. F. S. - Faculdade de Economia, Universidade do Porto - 2003

new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules. Both … solutions obtained by the heuristics. The computational results show that the function-based versions of the heuristics …

Persistent link: https://www.econbiz.de/10005059526

Filtered and Recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Valente, Jorge M. S.; Alves, Rui A. F. S. - Faculdade de Economia, Universidade do Porto - 2004

search and dispatch rule heuristics. Filtering procedures using both priority evaluation functions and problem …

Persistent link: https://www.econbiz.de/10005059573

Beam search algorithms for the early/tardy scheduling problem with release dates

Valente, Jorge M. S.; Alves, Rui A. F. S. - Faculdade de Economia, Universidade do Porto - 2004

filtered and recovering beam search heuristics. Extensive preliminary tests were performed to determine appropriate values for …

Persistent link: https://www.econbiz.de/10005059591