Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times

Yaron Leyvand, Dvir Shabtay, George Steiner

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

Scheduling problems with due date assignment and controllable processing times are studied in this paper. It is assumed that the job processing time is a linear function of the amount of resource allocated to the job, and all jobs share the same due date, which is a decision variable. The problems have many applications, e.g., in optimal delivery time quotation and order sequencing when outsourcing is an option. The quality of a schedule is measured by two different criteria. The first is the total weighted number of tardy jobs plus due date assignment cost, and the second one is the total weighted resource consumption. Four different problems for treating the two criteria are considered. It is shown that three of these problems are NP-hard in the ordinary sense, although the problem of minimizing an integrated objective function can be solved in polynomial time. A pseudo-polynomial time optimization algorithm is provided for the three NP-hard versions of the problem. A fully polynomial time algorithm for approximating a Pareto-optimal solution is also presented. Finally, important polynomially solvable special cases are highlighted.

Original languageEnglish
Pages (from-to)221-231
Number of pages11
JournalIIE Transactions (Institute of Industrial Engineers)
Volume42
Issue number3
DOIs
StatePublished - 1 Mar 2010

Keywords

  • Bicriteria scheduling
  • Controllable processing times
  • Delivery time quotation
  • Resource allocation

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times'. Together they form a unique fingerprint.

Cite this