Sciweavers

639 search results - page 54 / 128
» Integer Programming Models for Optimization Problems in Test...
Sort
View
118
Voted
MP
2010
145views more  MP 2010»
15 years 1 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
COR
2007
103views more  COR 2007»
15 years 2 months ago
A reactive GRASP and path relinking for a combined production-distribution problem
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
Mourad Boudia, Mohamed Aly Ould Louly, Christian P...
93
Voted
COR
2010
164views more  COR 2010»
15 years 2 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
138
Voted
CODES
2009
IEEE
15 years 9 months ago
FlexRay schedule optimization of the static segment
The FlexRay bus is the prospective automotive standard communication system. For the sake of a high flexibility, the protocol includes a static time-triggered and a dynamic event...
Martin Lukasiewycz, Michael Glaß, Jürge...
95
Voted
FLAIRS
2008
15 years 5 months ago
Reasoning with Conditional Time-Intervals
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...
Philippe Laborie, Jerome Rogerie