Add to ORKGIt is in accordance with just-in-time (JIT) philosophy to penalize early/tardy jobs. An optimal method genetic-based is presented to solve single machine scheduling problem with general early-tardy penalty weights in the paper. A new heuristic crossover operator is proposed for searching optimal sequences. On different scale of scheduling problems, lots of comparative experiments were carried out and the results manifested the method effectivenes
In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling proble...
Abstract―Scheduling problems are important NP-hard problems. Genetic algorithms can provide good sol...
We develop an optimised crossover operator designed by an undirected bipartite graph within a geneti...
It is in accordance with just-in-time (JIT) philosophy to penalize early/tardy jobs. An optimal meth...
This paper presents a genetic algorithm for a single machine-scheduling problem with the objective o...
This paper presents a mathematically enhanced genetic algorithm (MEGA) using the mathematical proper...
In this paper, a non linear mathematical model has been proposed for solving a single machine schedu...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
In this paper, a non linear mathematical model has been proposed for solving a single machine schedu...
In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling proble...
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...
We develop an optimised crossover operator designed by an undirected bipartite graph within a geneti...
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...
Abstract―Scheduling problems are important NP-hard problems. Genetic algorithms can provide good sol...
We develop an optimised crossover operator designed by an undirected bipartite graph within a geneti...
It is in accordance with just-in-time (JIT) philosophy to penalize early/tardy jobs. An optimal meth...
This paper presents a genetic algorithm for a single machine-scheduling problem with the objective o...
This paper presents a mathematically enhanced genetic algorithm (MEGA) using the mathematical proper...
In this paper, a non linear mathematical model has been proposed for solving a single machine schedu...
International audienceThe general one-machine scheduling problem is strongly NP-Hard when the object...
In this paper, a non linear mathematical model has been proposed for solving a single machine schedu...
In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling proble...
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...
We develop an optimised crossover operator designed by an undirected bipartite graph within a geneti...
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...
Abstract―Scheduling problems are important NP-hard problems. Genetic algorithms can provide good sol...
We develop an optimised crossover operator designed by an undirected bipartite graph within a geneti...