scientific article; zbMATH DE number 906534

MaRDI QIDQ4885615zbMATH OpenFDO

Authors Solomon R. Antony, C. Koulamas

Publication date 22 August 1996

zbMATH Keywords

heuristicsimulated annealingtotal tardiness problem

Mathematics Subject Classification ID

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

Recommendations

• Simulated annealing algorithm for solving the single machine early/tardy problem
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
• Scheduling in flowshops to minimize total tardiness of jobs
• Simulated annealing: A tool for operational research

Cited in

(5)

• The single-machine total tardiness scheduling problem: review and extensions
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
• Simulated annealing algorithm for solving the single machine early/tardy problem
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885615)