Optimal correction of execution intervals for multiprocessor scheduling with additional resource

Furugyan, M. G.

doi:10.1134/s1064230715020057

Cited by 8 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the same problem, the study of Özpeynirci et al [21] presented three constraint programming models. Multiprocessor scheduling with additional resources is studied by Furugyan [22] where the interruptions are allowed and the task execution may be switched from one processor to another. Dosa et al [23] studied the parallel machine scheduling with job assignment restrictions and renewable constrained resource.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimize Unrelated Parallel Machines Scheduling Problems With Multiple Limited Additional Resources, Sequence-Dependent Setup Times and Release Date Constraints

Al-Harkan

Qamhan

2019

IEEE Access

View full text Add to dashboard Cite

This paper considers the problem of scheduling a set of jobs on unrelated parallel machines subject to several constraints which are non-zero arbitrary release dates, limited additional resources, and non-anticipatory sequence-dependent setup times. The objective function is to minimize the maximum completion time. In order to find an optimal solution for this problem, a new mixed-integer linear programming model (MILP) is presented. Moreover, a two-stage hybrid metaheuristic based on variable neighborhood search hybrid and simulated annealing (TVNS_SA) is proposed. In the first stage, a developed heuristic is used to find an initial solution with good quality. At the second stage, the obtained initial solution is used as the first neighborhood structures in the proposed metaheuristic, for further progress different neighborhood structures and effective resolution schemes are also presented. The computational results indicate that the proposed metaheuristic is capable of obtaining optimal solutions for most of the instances when compared to the solution obtained by the developed mixed-integer linear programming model. In addition, the metaheuristic dominated the MILP with respect to computing time. The overall evaluation of the proposed algorithm shows its efficiency and effectiveness when compared with other algorithms. Finally, in order to obtain rigorous and fair conclusions, a paired t-test has been conducted to test the significant differences between the five variants of the TVNS_SA.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Optimize Unrelated Parallel Machines Scheduling Problems With Multiple Limited Additional Resources, Sequence-Dependent Setup Times and Release Date Constraints

Al-Harkan

Qamhan

2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Özpeynirci et al [29] also proposed three constraint programming models to solve the same problem. Furugyan [30] studied multiprocessor scheduling with an additional resource. In the study, interruptions were allowed, and task execution could be switched from one processor to another.…”

Section: Introductionmentioning

confidence: 99%

Modified Harmony Search Algorithm for Resource-Constrained Parallel Machine Scheduling Problem with Release Dates and Sequence-Dependent Setup Times

et al. 2021

View full text Add to dashboard Cite

This research focuses on the problem of scheduling a set of jobs on unrelated parallel machines subject to release dates, sequence-dependent setup times, and additional renewable resource constraints. The objective is to minimize the maximum completion time (makespan). To optimize the problem, a modified harmony search (MHS) algorithm was proposed. The parameters of MHS are regulated using full factorial analysis. The MHS algorithm is examined, evaluated, and compared to the best methods known in the literature. Four algorithms were represented from similar works in the literature. A benchmark instance has been established to test the sensitivity and behavior of the problem parameters of the different algorithms. The computational results of the MHS algorithm were compared with those of other metaheuristics. The competitive performance of the developed algorithm is verified, and it was shown to provide a 42% better solution than the others.

show abstract

Efficient Information and Communication Technologies in the Design of Transport and Logistics Centers of the New Silk Road

Ismailov

Kononov

Furugyan

2020

2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)

View full text Add to dashboard Cite

Optimal correction of execution intervals for multiprocessor scheduling with additional resource

Cited by 8 publications

References 6 publications

Optimize Unrelated Parallel Machines Scheduling Problems With Multiple Limited Additional Resources, Sequence-Dependent Setup Times and Release Date Constraints

Optimize Unrelated Parallel Machines Scheduling Problems With Multiple Limited Additional Resources, Sequence-Dependent Setup Times and Release Date Constraints

Modified Harmony Search Algorithm for Resource-Constrained Parallel Machine Scheduling Problem with Release Dates and Sequence-Dependent Setup Times

Efficient Information and Communication Technologies in the Design of Transport and Logistics Centers of the New Silk Road

Contact Info

Product

Resources

About