Sciweavers

908 search results - page 3 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
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
CP
2009
Springer
14 years 16 days ago
Closing the Open Shop: Contradicting Conventional Wisdom
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert
EUROGP
2006
Springer
135views Optimization» more  EUROGP 2006»
13 years 9 months ago
Dynamic Scheduling with Genetic Programming
This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next st...
Domagoj Jakobovic, Leo Budin
COR
2011
13 years 23 days ago
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Kerem Bülbül
IJIIP
2010
145views more  IJIIP 2010»
13 years 3 months ago
Solving Job Shop Scheduling Problem Using Genetic Algorithm with Penalty Function
Liang Sun, Xiaochun Cheng, Yanchun Liang