A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
type: Item
instance of: scholarly article
title: A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
zbMATH Open document ID: 1167.90503
author: N. E. Zubov
published in: Applied Mathematical Modelling
publication date: 2009-08-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5598015
zbMATH Keywords: single machine scheduling
zbMATH Keywords: earliness/tardiness
zbMATH Keywords: dominance properties
zbMATH Keywords: genetic algorithm
zbMATH Keywords: optimal schedule
describes a project that uses: Genocop
MaRDI profile type: Publication
full work available at URL: j.apm.2008.01.006
OpenAlex ID: W2048716671
cites work: The Single Machine Early/Tardy Problem
cites work: One-machine rescheduling heuristics with efficiency and stability as criteria
cites work: Q4055377
cites work: A branch and bound approach for single machine scheduling with earliness and tardiness penalties
cites work: Scheduling with release dates on a single machine to minimize total weighted completion time
cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
cites work: Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
cites work: Single machine earliness and tardiness scheduling
cites work: A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
cites work: Q4079017
cites work: Q4692508
cites work: Q4315824
cites work: The one-machine problem with earliness and tardiness penalties
cites work: A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
DOI: 10.1016/J.APM.2008.01.006
description: scientific article; zbMATH DE number 5598015