Ideal schedules in parallel machine settings

An ideal schedule is a schedule that simultaneously minimizes the two most popular scheduling objectives, namely the makespan and the total completion time. If a scheduling problem always has an ideal schedule, then the problem is called an ideal problem. We summarize ideal problem results of various scheduling problems in different machine environments and with job characteristics that include precedence constraints, release dates, processing times, eligibility constraints and preemptions. We present a comprehensive overview of ideal schedules including our new findings. (C) 2020 Elsevier B.V. All rights reserved.

Automated summary

An ideal schedule minimizes both makespan and total completion time simultaneously. If a scheduling problem always has an ideal schedule, it is called an ideal problem. This article provides a comprehensive overview of ideal schedules across different machine environments and job characteristics.