Minimizing the weighted sum of quadratic completion times on a single machine

Federico Della Croce, Wlodzimierz Szwarc, Roberto Tadei, Paolo Baracco and Raffaele di Tullio

Naval Research Logistics (NRL), 1995, vol. 42, issue 8, 1263-1270

Abstract: This article discusses the scheduling problem of minimizing the weighted sum of quadratic completion times on a single machine. It establishes links between orderings of adjacent and nonadjacent jobs that lead to a powerful branch and bound method. Computational results show that this method clearly outperforms the state of the art algorithm. © 1995 John Wiley & Sons. Inc.

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

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199512)42:83.0.CO;2-A

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:42:y:1995:i:8:p:1263-1270

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 ().