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

DOI10.1016/J.AMC.2007.04.063MaRDI QIDQ990722zbMATH OpenOpenAlexFDO

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

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 algorithmbi-criteria schedulingmaximum earlinessnumber of tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Using genetic algorithms for single-machine bicriteria scheduling problems
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
• scientific article; zbMATH DE number 1530367
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness

Cites work

• scientific article; zbMATH DE number 52239 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• An efficient genetic algorithm for determining the optimal price discrimination
• Complexity of single machine hierarchical scheduling: A survey
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Using genetic algorithms for single-machine bicriteria scheduling problems

Cited in

(14)

• An uncertain parallel machine problem with deterioration and learning effect
• RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
• Using genetic algorithms for single-machine bicriteria scheduling problems
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• An uncertain programming model for single machine scheduling problem with batch delivery
• Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
• A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
• Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
• A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs
• STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

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

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