Group Technology Scheduling with Due-Date Assignment and Controllable Processing Times

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 (including weighted sum of earliness, tardiness, assignment, where weights are position-dependent) resource-allocation costs. Given some optimal properties problem, if size jobs in each is identical, sequence can be obtained via an problem. We then illustrate that problem polynomially solvable O(℘3) time, ℘ number jobs.