Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects
Fei Teng, Si-Wen Luo, Dan‐Yang Lv, Ji‐Bo Wang
Abstract
In this paper, we consider scheduling problems with slack (different) due-window assignment and time-dependent processing times. The processing time functions are all a proportional linear increasing function of time. On a single-machine setting, the goal is to minimize a cost function that includes earliness, tardiness, due-window starting time and size, and the number of early and tardy jobs. Some relevant optimality properties and polynomial time solution algorithms are proposed to solve these two problems.
Topics & Concepts
TardinessScheduling (production processes)Mathematical optimizationDue dateComputer scienceTime complexitySingle-machine schedulingWindow (computing)Function (biology)AlgorithmJob shop schedulingMathematicsScheduleBiologyEvolutionary biologyOperating systemScheduling and Optimization AlgorithmsOptimization and Search ProblemsAdvanced Manufacturing and Logistics Optimization