This paper presents a genetic algorithm for a single machine-scheduling problem with the objective of minimizing total tardiness. Each job has its own due date and the set-up times are sequence dependent. The parameters of the genetic algorithm are determined by a statistical method. For small problems, the solutions given by the proposed method are compared with solutions provided by a commercial package, and for larger problems, with those obtained by a heuristic proposed in the literature.11771372
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling proble...
In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling proble...
We consider the problem of scheduling a number of jobs, each job having a release time, a processing...
It is in accordance with just-in-time (JIT) philosophy to penalize early/tardy jobs. An optimal meth...
It is in accordance with just-in-time (JIT) philosophy to penalize early/tardy jobs. An optimal meth...
In this paper, a non linear mathematical model has been proposed for solving a single machine schedu...
In this paper, a non linear mathematical model has been proposed for solving a single machine schedu...
This paper presents a mathematically enhanced genetic algorithm (MEGA) using the mathematical proper...
We develop an optimised crossover operator designed by an undirected bipartite graph within a geneti...
Abstract―Scheduling problems are important NP-hard problems. Genetic algorithms can provide good sol...
Optimal machine scheduling in general is unlikly to be solved in polynomial time. In practice heuris...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling proble...
In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling proble...
We consider the problem of scheduling a number of jobs, each job having a release time, a processing...
It is in accordance with just-in-time (JIT) philosophy to penalize early/tardy jobs. An optimal meth...
It is in accordance with just-in-time (JIT) philosophy to penalize early/tardy jobs. An optimal meth...
In this paper, a non linear mathematical model has been proposed for solving a single machine schedu...
In this paper, a non linear mathematical model has been proposed for solving a single machine schedu...
This paper presents a mathematically enhanced genetic algorithm (MEGA) using the mathematical proper...
We develop an optimised crossover operator designed by an undirected bipartite graph within a geneti...
Abstract―Scheduling problems are important NP-hard problems. Genetic algorithms can provide good sol...
Optimal machine scheduling in general is unlikly to be solved in polynomial time. In practice heuris...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling proble...
In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling proble...