Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times

Wu, Chin-Chia; Bai, Danyu; Chen, Juin-Han; Xing, Lining; Lin, Jia-Cheng; Cheng, Shuenn‐Ren

doi:10.1016/j.swevo.2020.100765

Cited by 38 publications

(18 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has become widely popular and can been applied to various supply chain planning and optimization problems in uncertain conditions. In this paper, we adopt the same robust optimization approach and measure as the one used in several other relevant studies that are similar in nature (e.g., Pishvaee et al [39], Rabbani et al [40], Wee et al [41]; Hendalianpour et al [42,43], Wu [44,45]). According to Pishvaee et al [39], such an approach is capable of controlling the degree of feasibility and optimality robustness and also establishing a reasonable tradeoff between the robustness, cost of robustness, and other objectives such as improving the average performance of the system.…”

Section: Robust Optimization Modelmentioning

confidence: 99%

See 1 more Smart Citation

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

Лю

Hendalianpour²,

Razmi

et al. 2021

Complex Intell. Syst.

View full text Add to dashboard Cite

Supply and distribution management of blood products is a challenging task due to their short lifespan. The problem is even more sophisticated considering uncertain demand for these products. This paper addresses integrated inventory-routing of blood in a supply chain network consisting of a single supplier and a group of blood centers. Transshipment among blood centers is allowed to decrease the cost of excess inventory and shortage of goods. A mathematical model is developed that decides on the optimal quantity of supplied blood, delivery plan, inventory level, and quantity of products transshipped between blood centers with the objective of minimizing total costs. In addition, a robust optimization approach is adopted to deal with uncertainty in demand. Since the proposed model is NP-hard, a heuristic solution algorithm is developed that improves solution quality by determining the most efficient change in vehicle routes in each search stage. The efficiency of the proposed algorithm is examined in a set of numerical experiments and using data from a real case of supply and distribution management of blood platelets. The results indicated that allowing transshipment reduces the need for supply capacity at the supplier, product shortage, inventory level, and the total cost.

show abstract

Section: Robust Optimization Modelmentioning

confidence: 99%

“…Constraints ( 42) and ( 43) update the inventory level of blood centers for products of age 2 and above as well as products of age 1. Constraint (44) shows the maximum allowable loss in each scenario. Constraint (45) defines the relationship between demand, the sum of inventory of different ages, and the shortage amount.…”

Section: Robust Optimization Modelmentioning

confidence: 99%

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

Лю

Hendalianpour²,

Razmi

et al. 2021

Complex Intell. Syst.

View full text Add to dashboard Cite

show abstract

“…For example, Borreguero-Sanchidrián et al studied a cyclic Flexible JSSP, where more than one machine may carry out one job and the number of assigned workers affects the processing time [8]. Similarly, Wu et al researched several approaches for when external factors change processing times, such as breakdowns and other failures [9]. One may also find the just-in-time variant, where operations within jobs have due dates and where completing an operation either early or late leads to a penalty [10].…”

Section: Index Termsmentioning

confidence: 99%

“…Literature depicts this strategy as a selection Hyper-Heuristic (HH), although there are other kinds of hyper-heuristics [21], [22], even for continuous optimization problems [23]. HHs have proved useful when tackling COPs, including the JSSP [9], [24]- [26].…”

Section: Index Termsmentioning

confidence: 99%

Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization

et al. 2021

View full text Add to dashboard Cite

“…Wu et al [4] proposed four cloud-theory-based simulated annealing (CSA) hyperheuristic algorithms incorporating seven low-level heuristics to solve a robust two-stage assembly flowshop problem with scenario-dependent processing times. Wu et al [5] also proposed five heuristics, adopting combined two-scenario-based processing times to produce initial solutions and then improve each solution through pairwise interchange.…”

Section: Introductionmentioning

confidence: 99%

Research on Reasoning concerning Emergency Measures for Industrial Project Scheduling Control

Han

Yan

Mei

2021

Advances in Civil Engineering

View full text Add to dashboard Cite

Industry is an important pillar of the national economy, and industrial projects are the most complex and difficult to manage and control in the construction industry; thus, the resource scheduling control of industrial projects is one of the core issues for industrial construction projects. The performance rate of the contract time periods of previous industrial construction projects has been very low. In scheduling control based on case-based reasoning (CBR), the goal is to implement preventive measures by referring to existing scheduling control cases and control the scheduling of resources through reasoning on emergency measures to prevent scheduling control deviations. In this paper, the rough set approach is used to represent the case feature information in a case reasoning model for industrial project scheduling control, attribute reduction is used to determine the weights of the feature attributes in the rough set representation, and the similarity between cases is calculated for case retrieval. The accuracy of the rough-set-based similarity calculation is verified through matrix similarity calculations and a visual analysis of the all closeness centrality and weighted all degree centrality of the corresponding complex network; thus, similar cases of industrial project scheduling control are identified. To verify the applicability and effectiveness of the proposed methodology, a typical coal chemical general contract project case is carried out. The rough set comprehensive similarity results were 0.733, 0.621, 0.536, 0.614, 0.559, 0.950, 0.708, 0.546, 0.733, 0.664, 0.526, and 0.743, and the matrix similarity results were 0.417, 0.583, 0.417, 0.417, 0.417, 0.833, 0.417, 0.500, 0.417, 0.500, 0.333, and 0.500. The results showed that the case retrieval accuracy of traditional matrix similarity is not as high as the rough set comprehensive similarity, so X 6 is the most similar case to the target case Y. Case retrieval results indicate that the proposed methodology can provide a good similar case selection strategy with project managers, and the final required preventive measures for the target case can be found. Based on the identified similar cases, preventive measures for scheduling control are formulated to effectively prevent scheduling deviations of industrial projects.

show abstract

Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times

Cited by 38 publications

References 20 publications

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization

Research on Reasoning concerning Emergency Measures for Industrial Project Scheduling Control

Contact Info

Product

Resources

About