by Jungwattanaki, J., Reodecha, M., Chaovalitwongse, P., Werner, F..
Series: 2005-28, Preprints
This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated problems. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. As objective function, the paper considers the minimization of the positively weighted convex sum of makespan and the number of tardy jobs. The paper develops some known constructive and iterative heuristics to the flexible flowshop environment. By using one of these heuristcs, the first stage sequence is generated. This will be used to construct a schedule for the overall problem. Detailed computational results with the algorithms are presented.
Flexible FlowShop, Heuristics, NEH, Genetic Algorithm, Simulated Annealing