Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
From MaRDI portal
Publication:990722
DOI10.1016/J.AMC.2007.04.063zbMATH Open1193.90102OpenAlexW1978109400MaRDI QIDQ990722FDOQ990722
M. Rabbani, Maryam Dehghan, A. Dabaghi, S. Amalnick, M. Yazadn Parast, 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
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
- Title not available (Why is that?)
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Complexity of single machine hierarchical scheduling: A survey
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
- Title not available (Why is that?)
- Using genetic algorithms for single-machine bicriteria scheduling problems
- An efficient genetic algorithm for determining the optimal price discrimination
Cited In (14)
- STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM
- An uncertain parallel machine problem with deterioration and learning effect
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
- Using genetic algorithms for single-machine bicriteria scheduling problems
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
- 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
- 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 genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
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)
