Sciweavers

447 search results - page 6 / 90
» Internet shopping optimization problem
Sort
View
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
15 years 4 months ago
GAMA (genetic algorithm driven multi-agents)for e-commerce integrative negotiation
Software agents help automate a variety of tasks including those involved in buying and selling products over the internet. The need for handling complex highly configurable produ...
Magda Bahaa Eldin Fayek, Ihab A. Talkhan, Khalil S...
JAIR
2006
121views more  JAIR 2006»
14 years 10 months ago
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
Matthew J. Streeter, Stephen F. Smith
IOR
2002
135views more  IOR 2002»
14 years 9 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
89
Voted
MP
2002
85views more  MP 2002»
14 years 9 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 1 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay