Sciweavers

1292 search results - page 130 / 259
» Revisiting the optimal scheduling problem
Sort
View
WOA
2007
15 years 7 months ago
A Swarm Intelligence Method Applied to Manufacturing Scheduling
—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup ti...
Davide Anghinolfi, Antonio Boccalatte, Alberto Gro...
EOR
2007
80views more  EOR 2007»
15 years 6 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
WAOA
2005
Springer
84views Algorithms» more  WAOA 2005»
15 years 11 months ago
A Note on Semi-online Machine Covering
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm i...
Tomás Ebenlendr, John Noga, Jiri Sgall, Ger...
130
Voted
CI
2002
92views more  CI 2002»
15 years 6 months ago
Model Selection in an Information Economy: Choosing What to Learn
As online markets for the exchange of goods and services become more common, the study of markets composed at least in part of autonomous agents has taken on increasing importance...
Christopher H. Brooks, Robert S. Gazzale, Rajarshi...
313
Voted
ESWA
2008
162views more  ESWA 2008»
15 years 6 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang