On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution

Joel Shwimer
Additional contact information
Joel Shwimer: Massachusetts Institute of Technology

Management Science, 1972, vol. 18, issue 6, B301-B313

Abstract: An efficient branch-bound algorithm is presented for solving the n-job, sequence-independent, single machine scheduling problem where the goal is to minimize the total penalty costs resulting from tardiness of jobs. The algorithm and computational results are given for the case of linear penalty functions. The modifications needed to handle the case of nonlinear penalty functions are also presented.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.6.B301 (application/pdf)

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:inm:ormnsc:v:18:y:1972:i:6:p:b301-b313

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().