Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects
Dan‐Yang Lv, Ji‐Bo Wang
Abstract
In this paper, different due-window assignment flow shop scheduling problem with learning effect and resource allocation is considered. Under two machine no-wait flow shop setting, the goal is to determine the due-window starting time, due-window size, optimal resource allocation and the optimal sequence of all jobs. A bicriteria analysis of the problem is provided where the first criterion is to minimize the scheduling cost (including earliness-tardiness penalty, due-window starting time and due-window size of all jobs) and the second criterion is to minimize the resource consumption cost. It is shown that four versions about scheduling cost and resource consumption cost can be solved in polynomial time.
Topics & Concepts
TardinessComputer scienceMathematical optimizationResource consumptionScheduling (production processes)Flow shop schedulingLearning effectDue dateJob shop schedulingWindow (computing)Real-time computingOperations researchMathematicsScheduleEconomicsEcologyOperating systemBiologyMicroeconomicsScheduling and Optimization AlgorithmsOptimization and Search ProblemsAdvanced Manufacturing and Logistics Optimization