In this paper, we study the scheduling of jobs on a single machine. Each of the n jobs will be processed without interruption and becomes available for processing at time zero. The goal is to find a processing order for the jobs, minimizing the total completion time, total late work, total earliness time, and maximum earliness maximum tardiness. The posed problems in this paper are as follows: The first problem is to minimize the multi-criteria, which includes minimizing the total completion time, total late work, total earliness time, maximum earliness, and maximum tardiness that are denoted by , respectively. The second problem is to minimize the multi-objective functions ( ). The theoretical section will present the mathematical formula for the discussed problem. Because these problems are NP-hard problems. It is difficult to determine the efficient (optimal) solution set for these problems. Some special cases are shown and proven to find efficient (optimal) solutions to the discussed problem. The significance of the dominance rule can be applied to problems to improve and to get good solutions that will be highlighted.
Solving the Multi-Criteria Problem: Total Completion Time, Total Late Work, Total Earliness Time, Maximum Earliness, and Maximum Tardine
Maximum Earliness
Maximum Tardiness
Multi-Criteria (MC)
Multi-Objective (MO)
Total Completion Times
Total Earliness Times
Total Late Work