A VNS-IG algorithm for dynamic seru scheduling problem with sequence-dependent setup time and resource constraints
Yiran Xiang,
Zhe Zhang,
Xue Gong and
Yong Yin
International Journal of Industrial and Systems Engineering, 2024, vol. 46, issue 1, 58-89
Abstract:
This paper is concerned with the unspecified dynamic scheduling problem by consideration of sequence-dependent setup time and resource constraints in the setups (UDSS-SR) in a new-type seru production system (SPS). The UDSS-SR problem is formulated as a mixed integer linear programming (MILP) model to minimise the makespan, and an iterative greedy algorithm based on variable neighbourhood search (VNS-IG) is designed subsequently to facilitate decision-making in the real environment to rationalise operations and additional resources. A set of test problems is generated, and computational experiments with different instance sizes are finally made. The results indicate that the proposed VNS-IG algorithm has good performance in solving seru scheduling problem in terms of solution quality and efficiency.
Keywords: scheduling; seru production; sequence-dependent setup time; resource constraint; hybrid intelligent algorithm. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.inderscience.com/link.php?id=135831 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:46:y:2024:i:1:p:58-89
Access Statistics for this article
More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().