Decomposition and hybrid simulated annealing heuristics for the parallel‐machine total tardiness problem

Christos Koulamas

Naval Research Logistics (NRL), 1997, vol. 44, issue 1, 109-125

Abstract: A polynomial decomposition heuristic is developed for the parallel‐machine tardiness problem (P&sol& sol;T) by extending the decomposition principle embedded in the single‐machine tardiness problem (1&sol/T) to a parallel‐machine setting. The subproblems generated by the decomposition are solved by an effective heuristic that yields solutions such that the schedule on any individual machine satisfies the single‐machine decomposition principle. A hybrid simulated annealing heuristic tailored to the P&sol/T problem is also presented. Computational results demonstrate the efficiency and effectiveness of the decomposition heuristic. © 1997 John Wiley & Sons, Inc.

Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199702)44:13.0.CO;2-E

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:44:y:1997:i:1:p:109-125

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().