Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm

DOI10.1016/0377-2217(94)00158-8zbMath0913.90182OpenAlexW2056852614MaRDI QIDQ1266571

Ziyong Cai, Avraham Shtub, Larry J. Le Blanc

Publication date: 29 November 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00158-8

zbMATH Keywords

simulated annealinggenetic algorithmheuristic algorithmspair-wise swap heuristicrepetitive projectsscheduling programs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (7)

Metaheuristics for multi-mode capital-constrained project payment scheduling ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective ⋮ Optimal segmentation of projects -- Schedule and cost considerations ⋮ Fuzzy sets and operations research: Perspectives ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling ⋮ Job rotation using the multi-period assignment model

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Optimal design of LAN-WAN internetworks: An approach using simulated annealing
• Note—Learning Effects in Economic Lot Sizing
• Production lot sizing under setup and worker learning
• Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm