Single machine slack due window assignment and deteriorating jobs
Li-Han Zhang, Xin-Na Geng, Jing Xue, Ji‐Bo Wang
Abstract
In this paper, we investigate the minmax single-machine scheduling problem with the slack due window, where the actual processing time of a job is the deterioration function of its starting time. The goal is to obtain the optimal schedule of the job and the related decision variables of the slack due window to minimize the linear combination cost function of the maximum earliness (tardiness) of the job and the due window. We show that this problem is solvable in O(n) time, and we carry out the numerical analysis, where $ n $ is the number of jobs.
Topics & Concepts
TardinessComputer scienceWindow (computing)Mathematical optimizationMinimaxFunction (biology)Scheduling (production processes)Due dateScheduleSingle-machine schedulingOperations researchJob shop schedulingMathematicsBiologyEvolutionary biologyOperating systemScheduling and Optimization AlgorithmsAssembly Line Balancing OptimizationAdvanced Manufacturing and Logistics Optimization