A simulated annealing approach to the solution of job rotation scheduling problems

DOI10.1016/j.amc.2006.09.082zbMath1137.90518OpenAlexW2093994736MaRDI QIDQ2371395

Mustafa Kurt, Serap Ulusam Seçkiner

Publication date: 4 July 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.09.082

zbMATH Keywords

integer programmingsimulated annealingjob rotation scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Reducing ergonomic risks by job rotation scheduling ⋮ Ant colony optimization for the job rotation scheduling problem ⋮ Temporary workforce planning with firm contracts: a model and a simulated annealing heuristic ⋮ The museum visitor routing problem

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems
• Single and multiobjective structural optimization in discrete‐continuous variables using simulated annealing
• A simulated annealing algorithm for dynamic layout problem

This page was built for publication: A simulated annealing approach to the solution of job rotation scheduling problems