We address a single machine family scheduling problem where jobs are partitioned into families and setup time is required between these families. For this problem, we propose a genetic algorithm using an optimized crossover operator to find an optimal schedule which minimizes the maximum...

The m-machine no-wait flowshop scheduling problem with the objective of minimizing total completion time subject to the constraint that the makespan value is not greater than a certain value is addressed in this paper. Setup times are considered non-zero values, and thus, setup times are treated...

This paper proposes several mixed integer programming models which incorporate optimal sequence properties into the models, to solve single machine family scheduling problems. The objectives are total weighted completion time and maximum lateness, respectively. Experiment results indicate that...