Gene Exchange Operators of Partheno-Genetic Algorithm for Permutation Flowshop Scheduling with Maximum and Minimum Time Lag Constraints

@inproceedings{Wang2015GeneEO,
  title={Gene Exchange Operators of Partheno-Genetic Algorithm for Permutation Flowshop Scheduling with Maximum and Minimum Time Lag Constraints},
  author={Bai Lin Wang and Haifeng Wang and Tieke Li},
  year={2015}
}
Permutation flowshop scheduling problem with maximum and minimum time lag constraints to minimize the makespan is considered, and a framework of partheno-genetic algorithm for the problem is presented. Based on the algorithm framework, two gene exchange operators are discussed, including single-point exchange operator and multi-point exchange operator. Experimental results show that if the single-point exchange operator is adopted in the parthenogenetic algorithm, the performance is good in… 

Tables from this paper

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags
Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP
Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints
This paper studies the order acceptance and scheduling problemonunrelated parallelmachineswithmachine eligibility constraints. Two objectives are considered to maximize total net profit and minimize

References

SHOWING 1-9 OF 9 REFERENCES
Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
TLDR
A mixed integer mathematical programming formulation which can be solved with the subroutine CPLEX is proposed, and several versions of simulated annealing algorithm to heuristically solve the problem are proposed.
Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness
  • Imen Hamdi
  • Business
    Int. J. Comb. Optim. Probl. Informatics
  • 2014
TLDR
This paper investigates the problem of n-jobs scheduling in an m-machine permutation flowshop with exact time lags between consecutive operations of each job, and proposes three mathematical formulations which are then solved by running the commercial software CPLEX to provide an optimal solution for small size problems.
Permutation flow shops with exact time lags to minimise maximum lateness
In this paper we investigate the m-machine permutation flow shop scheduling problem where exact time lags are defined between consecutive operations of every job. This generic model can be used for
Permutation flowshop scheduling problems with maximal and minimal time lags
Optimal charge plan model for steelmaking based on modified partheno-genetic algorithm
The charge plan plays an important role in compiling the production plan for steelmaking,and an optimized charge plan will have a far-reaching effect on the stability and efficiency of a steelmaking
A PARTHENO GENETIC ALGORITHM AND ANALYSIS ON ITS GLOBAL CONVERGENCE
TLDR
A partheno genetic algorithm (PGA) is proposed that uses ordinal strings and repeals crossover operators while introduces some particular genetic operators such as gene exchange operator which have the same function as crossover operators.