MINIMIZING THE WEIGHTED SUM OF QUADRATIC COMPLETION TIMES ON A SINGLE-MACHINE

Authors
DELLACROCE F SZWARC W TADEI R BARACCO P DITULLIO R
Citation
F. Dellacroce et al., MINIMIZING THE WEIGHTED SUM OF QUADRATIC COMPLETION TIMES ON A SINGLE-MACHINE, Naval research logistics, 42(8), 1995, pp. 1263-1270
Citations number
6
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Engineering, Marine
Journal title
Naval research logistics → ACNP
ISSN journal
0894069X
Volume
42
Issue
8
Year of publication
1995
Pages
1263 - 1270
Database
ISI
SICI code
0894-069X(1995)42:8<1263:MTWSOQ>2.0.ZU;2-M
Abstract
This article discusses the scheduling problem of minimizing the weight ed sum of quadratic completion times on a single machine. It establish es 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. (C) 1 995 John Wiley & Sons, Inc.