Due-window assignment and resource allocation scheduling with truncated learning effect and position-dependent weights (Q2213437)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Due-window assignment and resource allocation scheduling with truncated learning effect and position-dependent weights |
scientific article |
Statements
Due-window assignment and resource allocation scheduling with truncated learning effect and position-dependent weights (English)
0 references
1 December 2020
0 references
Summary: This paper studies single-machine due-window assignment scheduling problems with truncated learning effect and resource allocation simultaneously. Linear and convex resource allocation functions under common due-window (CONW) assignment are considered. The goal is to find the optimal due-window starting (finishing) time, resource allocations and job sequence that minimize a weighted sum function of earliness and tardiness, due window starting time, due window size, and total resource consumption cost, where the weight is position-dependent weight. Optimality properties and polynomial time algorithms are proposed to solve these problems.
0 references
0 references
0 references
0 references
0 references
0 references
0 references