Single machine sequencing with linear models of release dates

Adam Janiak

Naval Research Logistics (NRL), 1998, vol. 45, issue 1, 99-113

Abstract: The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot‐rolling process in steel mills. It is shown that the problem is strongly NP‐hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst‐case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998

Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199802)45:13.0.CO;2-G

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:navres:v:45:y:1998:i:1:p:99-113

Access Statistics for this article

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