Novel Heuristic Approach for Solving Multi-objective Scheduling Problems
In this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. Th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Baghdad
2021-08-01
|
| Series: | Ibn Al-Haitham Journal for Pure and Applied Sciences |
| Subjects: | |
| Online Access: | https://jih.uobaghdad.edu.iq/index.php/j/article/view/2677 |
| _version_ | 1818192184997838848 |
|---|---|
| author | Begard A. Amin Ayad M. Ramadan |
| author_facet | Begard A. Amin Ayad M. Ramadan |
| author_sort | Begard A. Amin |
| collection | DOAJ |
| description | In this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completion time and maximum tardiness. The second is minimizing total completion time and maximum earliness. We used these efficient solutions to find a near-optimal solution for another problem which is a sum of maximum earliness and maximum tardiness. This means we eliminate the total completion time from the two problems. The algorithm was tested on a set of problems of different n. Computational results demonstrate the efficiency of the proposed method. |
| first_indexed | 2024-12-12T00:26:29Z |
| format | Article |
| id | doaj.art-9e718eaa86834deb9ba22018b2596dc5 |
| institution | Directory Open Access Journal |
| issn | 1609-4042 2521-3407 |
| language | English |
| last_indexed | 2024-12-12T00:26:29Z |
| publishDate | 2021-08-01 |
| publisher | University of Baghdad |
| record_format | Article |
| series | Ibn Al-Haitham Journal for Pure and Applied Sciences |
| spelling | doaj.art-9e718eaa86834deb9ba22018b2596dc52022-12-22T00:44:36ZengUniversity of BaghdadIbn Al-Haitham Journal for Pure and Applied Sciences1609-40422521-34072021-08-01343505910.30526/34.3.26772578Novel Heuristic Approach for Solving Multi-objective Scheduling ProblemsBegard A. AminAyad M. RamadanIn this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completion time and maximum tardiness. The second is minimizing total completion time and maximum earliness. We used these efficient solutions to find a near-optimal solution for another problem which is a sum of maximum earliness and maximum tardiness. This means we eliminate the total completion time from the two problems. The algorithm was tested on a set of problems of different n. Computational results demonstrate the efficiency of the proposed method.https://jih.uobaghdad.edu.iq/index.php/j/article/view/2677scheduling problems, multi-objective function, maximum tardiness, maximum earliness, heuristic method. |
| spellingShingle | Begard A. Amin Ayad M. Ramadan Novel Heuristic Approach for Solving Multi-objective Scheduling Problems Ibn Al-Haitham Journal for Pure and Applied Sciences scheduling problems, multi-objective function, maximum tardiness, maximum earliness, heuristic method. |
| title | Novel Heuristic Approach for Solving Multi-objective Scheduling Problems |
| title_full | Novel Heuristic Approach for Solving Multi-objective Scheduling Problems |
| title_fullStr | Novel Heuristic Approach for Solving Multi-objective Scheduling Problems |
| title_full_unstemmed | Novel Heuristic Approach for Solving Multi-objective Scheduling Problems |
| title_short | Novel Heuristic Approach for Solving Multi-objective Scheduling Problems |
| title_sort | novel heuristic approach for solving multi objective scheduling problems |
| topic | scheduling problems, multi-objective function, maximum tardiness, maximum earliness, heuristic method. |
| url | https://jih.uobaghdad.edu.iq/index.php/j/article/view/2677 |
| work_keys_str_mv | AT begardaamin novelheuristicapproachforsolvingmultiobjectiveschedulingproblems AT ayadmramadan novelheuristicapproachforsolvingmultiobjectiveschedulingproblems |