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

DOI10.1007/S10479-008-0489-9zbMATH Open1202.90128OpenAlexW2045978072MaRDI QIDQ613776FDOQ613776

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

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

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)

Cites Work

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

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)