Sciweavers

447 search results - page 4 / 90
» Internet shopping optimization problem
Sort
View
90
Voted
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 2 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
IJCSS
2007
119views more  IJCSS 2007»
14 years 10 months ago
Trust in Electronic Markets - Customers' Perspective
People have trusted in face-to-face interaction more than any other modes of interactions to develop relationships and as a result of which one of the most concerned problem that ...
Shweta Sharma, Deepali Singh, D. P. Agrawal
ESWA
2008
162views more  ESWA 2008»
14 years 10 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
ECIS
2001
14 years 11 months ago
Dynamic Recommendations in Internet Retailing
With current projections regarding the growth of Internet sales, online retailing raises many questions about how to market on the Net. While convenience impels consumers to purch...
George Prassas, Katherine C. Pramataris, Olga Papa...
SCHEDULING
2010
104views more  SCHEDULING 2010»
14 years 4 months ago
A fluid approach to large volume job shop scheduling
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
Yoni Nazarathy, Gideon Weiss