Using genetic algorithms for single-machine bicriteria scheduling problems

DOI10.1016/S0377-2217(02)00220-5zbMath1011.90021OpenAlexW2005604709MaRDI QIDQ1869489

Ahmet Burak Keha, Murat M. 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

zbMATH Keywords

bicriteria schedulinggenetic algorithms

Mathematics Subject Classification ID

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

Related Items (8)

Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Genetic algorithms to solve the cover printing problem ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem ⋮ Pareto optima for total weighted completion time and maximum lateness on a single machine ⋮ Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs

Cites Work

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

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