190
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

Single-machine scheduling with deteriorating jobs

&
Pages 132-139 | Received 08 Jun 2009, Accepted 15 Mar 2010, Published online: 31 Aug 2010
 

Abstract

In this article, we study a single-machine scheduling problem in which the processing time of a job is a nonlinear function of its basic processing time and starting time. The objectives are to minimise the makespan, the sum of weighted completion times and the sum of the kth powers of completion times. We show that the makespan minimisation problem can be solved in polynomial time. However, the total completion time and the sum of the kth powers of completion times minimisation problems can be solved in polynomial time in some cases. Besides, some useful properties are also provided for the sum of weighted completion times problem under certain conditions.

Acknowledgements

We wish to express our appreciation to the Editor-in-Chief and the three referees for the valuable comments and suggestions on earlier versions of this article. This research is supported in part by the National Science Council of Taiwan, Republic of China, under grant number NSC-97-2221-E150-056-MY2.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,413.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.