Optimal due-date assignment problem with learning effect and resource-dependent processing times

Yuan Yuan Lu, Gang Li, Yu Bin Wu, Ping Ji

Research output: Journal article publicationJournal articleAcademic researchpeer-review

53 Citations (Scopus)


In this paper, we consider a single-machine earliness-tardiness scheduling problem with due-date assignment, in which the processing time of a job is a function of its position in a sequence and its resource allocation. The due date assignment methods studied include the common due date, and the slack due date, which reflects equal waiting time allowance for the jobs. For each combination of due date assignment method and processing time function, we provide a polynomial-time algorithm to find the optimal job sequence, due date values, and resource allocations that minimize an integrated objective function, which includes earliness, tardiness, due date assignment, and total resource consumption costs.
Original languageEnglish
Pages (from-to)113-127
Number of pages15
JournalOptimization Letters
Issue number1
Publication statusPublished - 1 Jan 2014


  • Due-date assignment
  • Learning effect
  • Resource allocation
  • Scheduling
  • Single-machine

ASJC Scopus subject areas

  • Control and Optimization

Cite this