A Sequencing Problem with Release Dates and Clustered Jobs

Marc E. Posner
Additional contact information
Marc E. Posner: Graduate School of Business Administration, New York University, New York, New York 10006

Management Science, 1986, vol. 32, issue 6, 731-738

Abstract: This paper considers a one-machine scheduling problem where the objective is to minimize the sum of weighted completion times subject to release dates. A polynomial time algorithm is developed for the case when the jobs are clustered. The jobs in each cluster must be processed sequentially and the clusters are ordered. The insights developed are used in an efficient heuristic for the weighted completion time problem without clusters. Also, a class of release date problems is described for which the heuristic finds an optimal solution.

Keywords: production scheduling; heuristics (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.32.6.731 (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:32:y:1986:i:6:p:731-738

Access Statistics for this article

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