Due date assignment and convex resource allocation scheduling with variable job processing times

Lin-Hui Sun, Kai Cui, Ju-hong Chen and Jun Wang

International Journal of Production Research, 2016, vol. 54, issue 12, 3551-3560

Abstract: This is a study of a earliness and tardiness sequencing and scheduling problem on a single machine. The processing time for job depends on its position in a sequence, its starting time, and its allocation of non-renewable resource. For three due date assignment methods i.e. the common due date, the slack due date and the unrestricted due date our goal is to find the optimal schedule, due dates, and resource allocations of jobs. We prove that three versions of the problem can be solved in polynomial time, respectively.

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

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2015.1083628 (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:54:y:2016:i:12:p:3551-3560

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

DOI: 10.1080/00207543.2015.1083628

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