Sciweavers

41 search results - page 5 / 9
» Solving Job Shop Scheduling Problem Using Genetic Algorithm ...
Sort
View
EOR
2010
104views more  EOR 2010»
13 years 4 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
AIPS
2009
13 years 8 months ago
Just-In-Time Scheduling with Constraint Programming
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
Jean-Noël Monette, Yves Deville, Pascal Van H...
EOR
2010
113views more  EOR 2010»
13 years 7 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis
ISCAS
2005
IEEE
179views Hardware» more  ISCAS 2005»
14 years 29 days ago
Robust stabilization of control systems using piecewise linear Lyapunov functions and evolutionary algorithm
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...
K. Tagawa, Y. Ohta