A note on unrelated parallel machine scheduling with time-dependent processing times

Kuo W-H, Hsu C-J and Dar-Li Yang
Additional contact information
Kuo W-H: National Formosa University
Hsu C-J: Nan-Kai Institute of Technology

Journal of the Operational Research Society, 2009, vol. 60, issue 3, 431-434

Abstract: Abstract In the literature, most of the parallel machine scheduling problems, in which the processing time of a job is a linear function of its starting time, are proved to be NP-hard. In this paper, we study an unrelated parallel machine scheduling problem in which the processing time of a job is a linear function of its starting time. The objective is to minimize the total completion time of all jobs. We consider two linear functions of job starting time in the problem and show that it is polynomially solvable.

Keywords: unrelated parallel machine; scheduling; total completion time (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2602576 Abstract (text/html)
Access to full text is restricted to subscribers.

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:pal:jorsoc:v:60:y:2009:i:3:d:10.1057_palgrave.jors.2602576

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2602576

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().