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.
- Approximation algorithm
- Bicriteria scheduling
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research
- Information Systems and Management