Sciweavers

547 search results - page 99 / 110
» Preference-Based Search for Scheduling
Sort
View
EOR
2010
107views more  EOR 2010»
13 years 10 months ago
An optimization-based heuristic for the robotic cell problem
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...
ESWA
2008
128views more  ESWA 2008»
13 years 10 months ago
Mining the data from a hyperheuristic approach using associative classification
Associative classification is a promising classification approach that utilises association rule mining to construct accurate classification models. In this paper, we investigate ...
Fadi A. Thabtah, Peter I. Cowling
EOR
2007
80views more  EOR 2007»
13 years 9 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai
RTS
2006
132views more  RTS 2006»
13 years 9 months ago
A framework for modular analysis and exploration of heterogeneous embedded systems
Abstract The increasing complexity of heterogeneous systems-on-chip, SoC, and distributed embedded systems makes system optimization and exploration a challenging task. Ideally, a ...
Arne Hamann, Marek Jersak, Kai Richter, Rolf Ernst
JAIR
2007
141views more  JAIR 2007»
13 years 9 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf