Affiliation:
1. Business School, Northwest Normal University, Lanzhou 730070, China
Abstract
This paper investigates common (slack) due-date assignment single-machine scheduling with controllable processing times within a group technology environment. Under linear and convex resource allocation functions, the cost function minimizes scheduling (including the weighted sum of earliness, tardiness, and due-date assignment, where the weights are position-dependent) and resource-allocation costs. Given some optimal properties of the problem, if the size of jobs in each group is identical, the optimal group sequence can be obtained via an assignment problem. We then illustrate that the problem is polynomially solvable in O(℘3) time, where ℘ is the number of jobs.
Funder
National Natural Science Regional Foundation of China
Subject
Process Chemistry and Technology,Chemical Engineering (miscellaneous),Bioengineering
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献