Single machine scheduling with sequence-dependent setup times and delayed precedence constraints

Kuo, Yiyo; Chen, Sheng-I; Yeh, Yen Hung

doi:10.1007/s12351-017-0349-y

Cited by 8 publications

(15 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A complete process of the VNS algorithm is able to found in Lu et al (2020) . VNS has been successfully employed in different optimization problems in supply chain management fields such as cross-docking ( Ranjbar and Saber, 2020 ), allocation–location ( Abbassi et al, 2020 ), inventory control, and network design ( Kuo et al, 2020 ), and distribution–production problems ( Tayebi-Araghi et al, 2020 ). VNS starts with an initialization procedure, while indicates in Fig.…”

Section: Presented Hybrid Meta-heuristic Algorithmsmentioning

confidence: 99%

An integrated sustainable medical supply chain network during COVID-19

Goodarzian

Taleizadeh

Ghasemi

et al. 2021

Engineering Applications of Artificial Intelligence

165

View full text Add to dashboard Cite

Nowadays, in the pharmaceutical industry, a growing concern with sustainability has become a strict consideration during the COVID-19 pandemic. There is a lack of good mathematical models in the field. In this research, a production–distribution–inventory–allocation–location problem in the sustainable medical supply chain network is designed to fill this gap. Also, the distribution of medicines related to COVID-19 patients and the periods of production and delivery of medicine according to the perishability of some medicines are considered. In the model, a multi-objective, multi-level, multi-product, and multi-period problem for a sustainable medical supply chain network is designed. Three hybrid meta-heuristic algorithms, namely, ant colony optimization, fish swarm algorithm, and firefly algorithm are suggested, hybridized with variable neighborhood search to solve the sustainable medical supply chain network model. Response surface method is used to tune the parameters since meta-heuristic algorithms are sensitive to input parameters. Six assessment metrics were used to assess the quality of the obtained Pareto frontier by the meta-heuristic algorithms on the considered problems. A real case study is used and empirical results indicate the superiority of the hybrid fish swarm algorithm with variable neighborhood search.

show abstract

Section: Presented Hybrid Meta-heuristic Algorithmsmentioning

confidence: 99%

An integrated sustainable medical supply chain network during COVID-19

Goodarzian

Taleizadeh

Ghasemi

et al. 2021

Engineering Applications of Artificial Intelligence

165

View full text Add to dashboard Cite

show abstract

“…The benchmark problem set. To fairly compare the performance of the proposed LIG algorithm with that of the existing best solution algorithm, i.e., VNS, the benchmark problem set in a similar approach considered by Kuo et al 2 was generated and used in this study. The benchmark problem set consisted of 540 test instances that were produced as described herein.…”

Section: Computational Experimentation and Resultsmentioning

confidence: 99%

“…the grid (1, 2) and its corresponding grid (2, 1) are refilled with 35 and P, respectively. The second DP constraint is (2,3) 0 DPC  , the grids (2, 3) and (3, 2) are refilled as 0 and P, respectively. Since job 3 also must be processed after job 1, the grid (3, 1) is refilled with P. In the same way, processing the three remaining DP constraints gives the final lag times of the DP constraints table as shown in Table 3. )…”

Section: The Lean Iterated Greed Algorithmmentioning

confidence: 99%

“…Nonetheless, DP constraint means that specific pairs of jobs require a delay between the completion time of the predecessor and the start time of the successor. This constraint usually occurs when the workpiece needs to be processed multiple times on the machine/facility based on precedence constraints and waits for its temperature to drop, or its glue/color painted to dry 2 . Using the three-field notation scheme proposed by Graham 5 , the addressed problem can be signified as…”

Section: Introductionmentioning

confidence: 99%

“…2 presented a makespan calculation model, a non-linear programming model, a variable neighborhood search (VNS) metaheuristic, and five simulated annealing (SA) algorithms for solving the…”

mentioning

confidence: 99%

See 2 more Smart Citations

Single Machine Scheduling Problems With Sequence-dependent Setup Times and Precedence Delays

Lin

Ying

2021

Preprint

View full text Add to dashboard Cite

Sequence-dependent setup times (SDSTs) and delayed precedence (DP) occur commonly in various manufacturing settings. This study investigated the single machine scheduling problem with SDSTs and DP constraints arising in an amplifier assembly company. A mixed-integer linear programming model and a lean iterated greedy (LIG) algorithm is proposed to search for the best job sequence with minimum makespan. Based on the characteristic of delayed precedence constraints of the problem, the proposed LIG algorithm implements a straightforward but effective lean construction mechanism, which can keep the search process within the feasible solution space and quickly converge toward the (near-) global optimum. Computational results reveal that LIG significantly outperforms the state-of-the-art algorithm in terms of solution quality and computational efficiency. This study mainly contributes to providing a simple, effective, and efficient algorithm that can facilitate industrial applications and act as a new benchmark approach for future research.

show abstract