Premium
Minimizing the weighted sum of quadratic completion times on a single machine
Author(s) -
Croce Federico Della,
Szwarc Wlodzimierz,
Tadei Roberto,
Baracco Paolo,
di Tullio Raffaele
Publication year - 1995
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199512)42:8<1263::aid-nav3220420810>3.0.co;2-a
Subject(s) - quadratic equation , computer science , completion (oil and gas wells) , mathematics , single machine scheduling , mathematical optimization , combinatorics , algorithm , statistics , engineering , geometry , job shop scheduling , mechanical engineering , schedule , operating system
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.