Scheduling of a single machine to minimize total weighted completion time subject to release dates

Lucio Bianco and Salvatore Ricciardelli

Naval Research Logistics Quarterly, 1982, vol. 29, issue 1, 151-167

Abstract: In this paper the n/1/rj Σj wj Cj problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are obtained and a branch and bound algorithm is proposed. Computational results are reported and discussed.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1002/nav.3800290114

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:navlog:v:29:y:1982:i:1:p:151-167

Access Statistics for this article

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