Asia Pacific Journal of Operational Research · 2022 · 10 citations · 35 references
ManagementIndustrial EngineeringOperations ManagementAlgorithmsOptimizationSchedulingJob SchedulingMachine SchedulingSchedule OptimizationScheduling OptimizationScheduling TheoryTardiness MinimizationDue DatesPolynomial Time ComplexityPolynomial-time AlgorithmsScheduling With Due DatesSingle-machine SchedulingSingle-machine Tardiness SchedulingSlack In Resource-constrained SchedulingSlack-based Scheduling
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.
35
A survey on scheduling problems with due windows
Adam Janiak, Władysław Janiak, Tomasz Krysiak et al. · European Journal of Operational Research · 2014 · 133 citations