Using Simulated Annealing for Open Shop Scheduling with Sum Criteria

What is it about?

This book chapter deals with the open shop scheduling problem to minimize a sum function (e.g. total flow time or total tardiness). The core is the development of a simulated annealing algorithm by using latin rectangles as representation of feasble schedules.

Featured Image

Why is it important?

Most papers in the literature deal with makespan minimization problems in this field. Some important differences in the behavior of solution algorithms are pointed out.