Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations.

Under common due window assignment, a single machine scheduling problem with learning effect, delivery time and convex resource allocation is considered. Actual processing time is related to normal processing time, job dependent learning effect and allocated resources. There are three objective functions are considered. They involve earliness, tardiness, due window costs and resource costs with position dependent weights. The first objective function is to minimize the total costs of earliness, tardiness, start time of window, window size and resource allocation; the second objective function is to minimize the total costs of earliness, tardiness, start time of window and window size under resource-limited conditions; the third objective function is to minimize the cost of resource allocation under the scheduling function constraint. The goal is to determine the optimal sequence and resource allocation. All three problems are proved that they can be solved in polynomial time and polynomial time algorithms are given separately. [ABSTRACT FROM AUTHOR]