Order scheduling with controllable processing times, common due date and the processing deadline

详细信息    查看全文

• 作者：Qing Yue ; Guohua Wan
• 关键词：Order scheduling ; due date assignment ; controllable processing times ; deadline
• 刊名：Journal of Systems Science and Systems Engineering
• 出版年：2017
• 出版时间：April 2017
• 年：2017
• 卷：26
• 期：2
• 页码：199-218
• 全文大小：
• 刊物类别：Engineering
• 刊物主题：Complexity; Economic Theory/Quantitative Economics/Mathematical Methods; Operation Research/Decision Theory;
• 出版者：Springer Berlin Heidelberg
• ISSN：1861-9576
• 卷排序：26

文摘

Due date quotation and scheduling are important tools to match demand with production capacity in the MTO (make-to-order) environment. We consider an order scheduling problem faced by a manufacturing firm operating in an MTO environment, where the firm needs to quote a common due date for the customers, and simultaneously control the processing times of customer orders (by allocating extra resources to process the orders) so as to complete the orders before a given deadline. The objective is to minimize the total costs of earliness, tardiness, due date assignment and extra resource consumption. We show the problem is NP-hard, even if the cost weights for controlling the order processing times are identical. We identify several polynomially solvable cases of the problem, and develop a branch and bound algorithm and three Tabu search algorithms to solve the general problem. We then conduct computational experiments to evaluate the performance of the three Tabu-search algorithms and show that they are generally effective in terms of solution quality.