Single-machine scheduling with periodic maintenance and learning effect

This paper discusses a single-machine scheduling problem with periodic maintenance activities and position-based learning effect to minimize the makespan. To obtain exact solutions of small-scale problems, one new two-stage binary integer programming model is formulated. In addition, a branch and bo...

Full description

Saved in:
Bibliographic Details
Published in:Scientific reports Vol. 13; no. 1; pp. 9309 - 15
Main Authors: Wu, Hui, Zheng, Hongmei
Format: Journal Article
Language:English
Published: London Nature Publishing Group UK 08.06.2023
Nature Publishing Group
Nature Portfolio
Subjects:
ISSN:2045-2322, 2045-2322
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper discusses a single-machine scheduling problem with periodic maintenance activities and position-based learning effect to minimize the makespan. To obtain exact solutions of small-scale problems, one new two-stage binary integer programming model is formulated. In addition, a branch and bound algorithm combining boundary method and pruning rules is also proposed. According to the property of the optimal solution, a special search neighborhood is constructed. A hybrid genetic-tabu search algorithm based on genetic mechanism with tabu technique as an operator is proposed to solve medium-scale and large-scale problems. Moreover, to improve the efficiency of genetic algorithm and hybrid genetic-tabu search algorithm, Taguchi method is used for parameter tuning. Furthermore, computational experiments are carried out to compare the efficiency and performance of these algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2045-2322
2045-2322
DOI:10.1038/s41598-023-36056-w