Scheduling start time dependent jobs to minimize the total weighted completion time

A Bachman (), T C E Cheng, A Janiak () and C T Ng
Additional contact information
A Bachman: Wroclaw University of Technology
T C E Cheng: The Hong Kong Polytechnic University
A Janiak: Wroclaw University of Technology
C T Ng: The Hong Kong Polytechnic University

Journal of the Operational Research Society, 2002, vol. 53, issue 6, 688-693

Abstract: Abstract This paper deals with a single machine scheduling problem with start time dependent job processing times. The job processing times are characterized by decreasing linear functions dependent on their start times. The problem is to find a schedule for which the total weighted completion time is minimized. It is proved that the problem is NP-hard. Some properties of special cases of the general problem are also given. Based on these results, two heuristic algorithms are constructed and their performance is compared.

Keywords: computational analysis; scheduling; heuristics; start time dependent processing time; single machine (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601359 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:53:y:2002:i:6:d:10.1057_palgrave.jors.2601359

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

DOI: 10.1057/palgrave.jors.2601359

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 ().