Optimal coordination of resource allocation, due date assignment and scheduling decisions

• Published in: Omega (Oxford) Vol. 65; pp. 41 - 54
• Main Authors: Shabtay, Dvir, Steiner, George, Zhang, Rui
• Format: Journal Article
• Language: English
• Published: Oxford Elsevier Ltd 01.12.2016; Pergamon Press Inc
• Subjects: Approximation algorithm; Assignment problem; Bicriteria scheduling; Consumption function; Decision making; FPTAS; Job shops; Resource allocation; Scheduling algorithms; Studies; Approximation algorithm; FPTAS; Bicriteria scheduling
• ISSN: 0305-0483; 1873-5274
• DOI: 10.1016/j.omega.2015.12.006

We study a single-machine scheduling problem in a flexible framework, where both job processing times and due dates are decision variables controllable by the scheduler. Our objective is to provide a practical tool for managers to optimally (or approximately) coordinate higher level decisions (such as delivery date quotation) with lower level (operational) decisions (such as scheduling and resource allocation). We analyze the problem for two due date assignment methods and a convex resource consumption function. For each due date assignment method, we provide a bicriteria analysis where the first criterion is to minimize the total weighted number of tardy jobs plus due date assignment cost, and the second criterion is to minimize total weighted resource consumption. These bicriteria problems are known to be NP-hard. In this paper, for each due date assignment method, we develop pseudo-polynomial algorithm and fully polynomial time approximation scheme (FPTAS) to minimize the total weighted number of tardy jobs plus due date assignment costs subject to an upper bound on the total weighted resource consumption. •Our problem includes due date assignment, scheduling and resource allocation decisions.•We aim to minimize due date assignment plus scheduling costs.•The total resource allocation cost is bounded.•The problem is known to be NP-hard.•For two variants, we construct an optimization algorithm and an FPTAS.