Sciweavers

19 search results - page 3 / 4
» A hybrid method for solving stochastic job shop scheduling p...
Sort
View
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
13 years 10 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
KR
1992
Springer
13 years 10 months ago
Intelligent Backtracking Techniques for Job Shop Scheduling
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
Yalin Xiong, Norman M. Sadeh, Katia P. Sycara
ANOR
2008
171views more  ANOR 2008»
13 years 6 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
AAAI
2000
13 years 7 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
WSC
2001
13 years 7 months ago
Using simulation and neural networks to develop a scheduling advisor
The research using artificial intelligence and computer simulation introduces a new approach for solving the job shop-scheduling problem. The new approach is based on the developm...
Thanos Alifantis, Stewart Robinson