Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
type: Item
instance of: scholarly article
title: Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
zbMATH Open document ID: 1193.90102
author: S. Amalnick
author: A. Dabaghi
author: Maryam Dehghan
author: M. Yazadn Parast
author: Fariborz Jolai
author: M. Rabbani
published in: Applied Mathematics and Computation
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5777156
zbMATH Keywords: genetic algorithm
zbMATH Keywords: bi-criteria scheduling
zbMATH Keywords: number of tardy jobs
zbMATH Keywords: maximum earliness
MaRDI profile type: Publication
full work available at URL: j.amc.2007.04.063
OpenAlex ID: W1978109400
cites work: Q4692508
cites work: Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
cites work: Q4002567
cites work: Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
cites work: Using genetic algorithms for single-machine bicriteria scheduling problems
cites work: Complexity of single machine hierarchical scheduling: A survey
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: An efficient genetic algorithm for determining the optimal price discrimination
DOI: 10.1016/J.AMC.2007.04.063
description: scientific article; zbMATH DE number 5777156