scholarly journals Primary–secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines

2014 ◽  
Vol 518 ◽  
pp. 117-123 ◽  
Author(s):  
Long Wan ◽  
Ran Ma ◽  
Jinjiang Yuan
Keyword(s):  
Completion Time ◽  
Total Completion Time ◽  
Bicriteria Scheduling ◽  
Identical Machines

Efficient Heuristics for Total Completion Time and Maximum Lateness Bicriteria Scheduling Problems

2020 ◽  
Vol 35 ◽  
pp. 110-121
Author(s):  
Saheed Akande
Keyword(s):  
Completion Time ◽  
Computational Experiment ◽  
Optimal Solution ◽  
Maximum Lateness ◽  
Total Completion Time ◽  
Release Dates ◽  
Optimal Solutions ◽  
Scheduling Problems ◽  
Bicriteria Scheduling ◽  
Solution Methods

This paper considers the bicriteria scheduling problem of minimizing the total completion time and maximum lateness with zero release dates. The problem is NP hard, though Early Due Date (EDD) and Shortest Processing Time (SPT) rules yielded optimal solutions for maximum lateness and total completion time, respectively if each criterion were to be considered singly. Thus, the values of each of the criteria for the two proposed heuristics; SII and PI were compared to the optimal solution of the sub problems. Results of computational experiment on job sizes varies from 5-100 jobs showed that the two proposed solution methods yielded results not significantly different from the optimal. This is because the two heuristic yielded results not significantly from the optimal sub-problems for the two performance measures at 95% significant level.

Flexible open-shop problem for minimizing weighted total completion time

2021 ◽  
pp. 1-14
Author(s):  
Iman Khosravi Mashizi ◽  
Vahid Momenaei Kermani ◽  
Naser Shahsavari-Pour
Keyword(s):  
Completion Time ◽  
Memetic Algorithm ◽  
Total Completion Time ◽  
Initial Population ◽  
Remarkable Improvement ◽  
Metaheuristic Methods ◽  
Open Shop Problem ◽  
Identical Machines ◽  
Overall Performance ◽  
Feasible Solutions

In this article, scheduling flexible open shops with identical machines in each station is studied. A new mathematical model is offered to describe the overall performance of the system. Since the problem enjoys an NP-hard complexity structure, we used two distinct metaheuristic methods to achieve acceptable solutions for minimizing weighted total completion time as the objective function. The first method is customary memetic algorithm (MA). The second one, MPA, is a modified version of memetic algorithm in which the new permutating operation is replaced with the mutation. Furthermore, some predefined feasible solutions were imposed in the initial population of both MA and MPA. According to the results, the latter action caused a remarkable improvement in the performance of algorithms.

Sign in / Sign up

Export Citation Format

Share Document