scholarly journals Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints

2011 ◽  
Vol 412 (12-14) ◽  
pp. 1081-1091 ◽  
Author(s):  
Yumei Huo ◽  
Hairong Zhao
2020 ◽  
Vol 35 ◽  
pp. 110-121
Author(s):  
Saheed Akande

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.


2013 ◽  
Vol 37 (5) ◽  
pp. 3126-3137 ◽  
Author(s):  
Behdin Vahedi-Nouri ◽  
Parviz Fattahi ◽  
Mohammad Rohaninejad ◽  
Reza Tavakkoli-Moghaddam

Sign in / Sign up

Export Citation Format

Share Document