Using genetic algorithms for single-machine bicriteria scheduling problems

DOI10.1016/S0377-2217(02)00220-5zbMATH Open1011.90021OpenAlexW2005604709MaRDI QIDQ1869489FDOQ1869489

Authors: Ahmet Keha, Murat Köksalan 

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00220-5

Recommendations

• A hybrid genetic algorithm for the single machine scheduling problem
• Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
• Investigating the use of genetic programming for a classic one-machine scheduling problem
• Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs
• GENETIC ALGORITHMS FOR SINGLE MACHINE JOB SCHEDULING WITH COMMON DUE DATE AND SYMMETRIC PENALTIES
• An improved genetic algorithm for single-machine inverse scheduling problem
• An improved genetic algorithm for single machine scheduling problems with deteriorating jobs
• Multi-objective genetic algorithm for single machine scheduling problem under fuzziness

zbMATH Keywords

genetic algorithmsbicriteria scheduling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Complexity of single machine, multi-criteria scheduling problems
• Complexity of single machine hierarchical scheduling: A survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Title not available (Why is that?)
• Genetic Algorithms
• Multiple and bicriteria scheduling: A literature survey
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• An Efficient Method for Generating Discrete Random Variables with General Distributions
• Title not available (Why is that?)
• Minimizing flow time variance in a single machine system using genetic algorithms
• Genetic algorithms for the two-stage bicriteria flowshop problem
• A single-machine problem with multiple criteria

Cited In (12)

• Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
• Genetic algorithms to minimize the weighted number of late jobs on a single machine.
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Genetic algorithms to solve the cover printing problem
• A genetic algorithm-based approach to machine assignment problem
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
• Multi-step crossover genetic algorithm for bi-criteria parallel machine scheduling problems
• New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
• Pareto optima for total weighted completion time and maximum lateness on a single machine

This page was built for publication: Using genetic algorithms for single-machine bicriteria scheduling problems

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