Minimizing Total Costs in One-Machine Scheduling

A. H. G. Rinnooy Kan, B. J. Lageweg and J. K. Lenstra
Additional contact information
A. H. G. Rinnooy Kan: Graduate School of Management, Delft, The Netherlands
B. J. Lageweg: Mathematisch Centrum, Amsterdam, The Netherlands
J. K. Lenstra: Mathematisch Centrum, Amsterdam, The Netherlands

Operations Research, 1975, vol. 23, issue 5, 908-927

Abstract: Suppose we have n jobs that arrive simultaneously to be processed on a continuously available machine that can handle only one job at a time. Each job has a fixed processing time and a cost function that is nondecreasing in its finishing time. We want to find a schedule that minimizes total costs. After reviewing the relevant work on this problem, we present a new algorithm for a general cost function. The algorithm is tested for the well known case of a weighted tardiness criterion.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.5.908 (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:oropre:v:23:y:1975:i:5:p:908-927

Access Statistics for this article

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