Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm
type: Item
instance of: scholarly article
title: Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm
zbMATH Open document ID: 0913.90182
DOI: 10.1016/0377-2217(94)00158-8
author: Avraham Shtub
author: Larry J. Le Blanc
author: Ziyong Cai
published in: European Journal of Operational Research
publication date: 1998-11-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 1208538
zbMATH Keywords: scheduling programs
zbMATH Keywords: repetitive projects
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: simulated annealing
zbMATH Keywords: genetic algorithm
zbMATH Keywords: pair-wise swap heuristic
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00158-8
OpenAlex ID: W2056852614
cites work: Optimal design of LAN-WAN internetworks: An approach using simulated annealing
cites work: Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing
cites work: Q4692508
cites work: Production lot sizing under setup and worker learning
cites work: Optimization by Simulated Annealing
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Note—Learning Effects in Economic Lot Sizing
description: scientific article; zbMATH DE number 1208538