Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems

DOI10.1007/S10479-008-0489-9MaRDI QIDQ613776zbMATH OpenOpenAlexFDO

Authors Sumit K. Garg

Publication date 22 December 2010

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-008-0489-9

zbMATH Keywords

single machine schedulingartificial chromosomesevolutionary algorithm with probabilistic modelsflowshop machine schedulingtotal deviations

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
• A hybrid genetic algorithm for the job shop scheduling problem
• Large-Scale Scientific Computing
• Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems
• scientific article; zbMATH DE number 1785836

Cites work

• scientific article; zbMATH DE number 1702339 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 1054947 (Why is no real title available?)
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• A comprehensive review and evaluation of permutation flowshop heuristics
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• A genetic algorithm for flowshop sequencing
• A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• A survey of optimization by building and using probabilistic models
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An electromagnetism-like mechanism for global optimization
• Current trends in deterministic scheduling
• Dominance-based heuristics for one-machine total cost scheduling problems
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Flowshop-scheduling problems with makespan criterion: a review
• Improved heuristics for the early/tardy scheduling problem with no idle time
• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
• One-machine rescheduling heuristics with efficiency and stability as criteria
• Representation theory of semisimple Hopf algebras
• Scheduling with release dates on a single machine to minimize total weighted completion time
• Single machine earliness and tardiness scheduling
• The Single Machine Early/Tardy Problem
• The one-machine problem with earliness and tardiness penalties
• Towards a new evolutionary computation. Advances on estimation of distribution algorithms.

Cited in

(3)

• EA/G-GA for single machine scheduling problems with earliness/tardiness costs
• A self-guided genetic algorithm for permutation flowshop scheduling problems
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation

Describes a project that uses

Uses Software

• MOTGA

This page was built for publication: Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613776)