Simulated annealing algorithm for solving the single machine early/tardy problem

DOI10.1080/00207729608929256zbMath0858.90108OpenAlexW2053908297MaRDI QIDQ4895700

No author found.

Publication date: 23 March 1997

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729608929256

zbMATH Keywords

simulated annealingbranch-and-boundtest problemssingle machine early/tardy problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Simulated annealing: A tool for operational research
• Real-time scheduling of an automated manufacturing center
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Simulated annealing for machine layout problems in the presence of zoning constraints
• Sequencing with Earliness and Tardiness Penalties: A Review
• The Single Machine Early/Tardy Problem

This page was built for publication: Simulated annealing algorithm for solving the single machine early/tardy problem