Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs

DOI10.1016/j.amc.2007.04.063zbMath1193.90102OpenAlexW1978109400MaRDI QIDQ990722

Maryam Dehghan, A. Dabaghi, S. Amalnick, M. Yazadn Parast, Masoud Rabbani, Fariborz Jolai

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.04.063

zbMATH Keywords

genetic algorithmnumber of tardy jobsbi-criteria schedulingmaximum earliness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect ⋮ Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem ⋮ Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity ⋮ An uncertain programming model for single machine scheduling problem with batch delivery ⋮ An uncertain parallel machine problem with deterioration and learning effect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• An efficient genetic algorithm for determining the optimal price discrimination
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Using genetic algorithms for single-machine bicriteria scheduling problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs