Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties

Shlomo Karhi and Dvir Shabtay

International Journal of Production Research, 2018, vol. 56, issue 9, 3080-3096

Abstract: We study a single-machine scheduling problem in a flexible framework, where both job processing times and due dates are decision variables to be determined by the scheduler. We consider the case where each of the job processing times is a convex decreasing function of the amount of non-renewable resource that is allocated to the corresponding processing operation. Moreover, we consider two of the more common due-date assignment methods. For each of the methods, our objective is to find a solution minimising the total resource consumption cost, given an upper bound on the value of the weighted number of tardy jobs plus due date assignment costs. Since the problem is known to be NP$ \mathcal NP $-hard, we focus on designing approximation algorithms.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2017.1400708 (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:taf:tprsxx:v:56:y:2018:i:9:p:3080-3096

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2017.1400708

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().