Performance-extending approaches for total tardiness scheduling problem on one machine

zbMATH Open1183.90467MaRDI QIDQ3640445FDOQ3640445

Authors: Jingjie Xiao, Xiaolin Huang, Shuning Wang 

Publication date: 11 November 2009

Recommendations

• Decomposition of the single machine total tardiness problem
• A new decomposition approach for the single machine total tardiness scheduling problem
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• On decomposition of the total tardiness problem
• Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem

zbMATH Keywords

heuristicsdecomposition algorithmperformance evaluation function

Mathematics Subject Classification ID

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

Cited In (1)

• Scheduling with Multiple Performance Measures: The One-Machine Case

This page was built for publication: Performance-extending approaches for total tardiness scheduling problem on one machine

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