Minimizing Makespan In A Flow Shop Scheduling Problem Considering A Time-based Learning Effect

摘要

In this paper a Time-dependent learning effect in a flowshop is considered. This means that the processing time ofan operation is dependent on the cumulative machine time. The objective is the minimization of the makespan. Twoheuristic algorithms are proposed: The first one is a constructive heuristic algorithm that finds a near-optimal solution.The second algorithm improves such a solution using an iterative process. The results of the algorithm are comparedagainst a lower bound. Computational results show that the difference between the solutions are highly significantwhen a time-dependent learning effect is considered.