, three construction heuristics and an Ant Colony System (ACS) algorithm are developed for solving this integrated problem … scheduling n jobs on m identical parallel machines is solved such that the expected makespan is minimised. The machines are …

of meta-heuristics have been proposed in the past. However, tuning algorithm-specific parameters for solving FFSP is … are chosen for the study because these are not only recent meta-heuristics but they do not require tuning of algorithm …Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem …

algorithm based on branch and price that combines methods from bin packing, scheduling and graph coloring, with appropriate … modifications. The algorithm has a good computational performance even for parallel machine scheduling without conflicting jobs …We consider an extension of classic parallel machine scheduling where a set of jobs is scheduled on identical parallel …

Scheduling problems occur in a broad range of real-world application fields and have attracted a huge set of research … articles. However, there is only little research on exact algorithms for scheduling problems, many of which are NP-hard in the …-dependent setup times. First, we adopt a serial branch-and-bound algorithm from the literature and present a modified branching …