Sciweavers

3 search results - page 1 / 1
» Applying machine based decomposition in 2-machine flow shops
Sort
View
EOR
2006
87views more  EOR 2006»
13 years 4 months ago
Applying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
Saral Mukherjee, A. K. Chatterjee
ESWA
2008
162views more  ESWA 2008»
13 years 5 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
LOCA
2007
Springer
13 years 11 months ago
Inferring the Everyday Task Capabilities of Locations
Abstract. People rapidly learn the capabilities of a new location, without observing every service and product. Instead they map a few observations to familiar clusters of capabili...
Patricia Shanahan, William G. Griswold