An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem

Seidgar, Hany; Kiani, Morteza; Abedi, Mehdi; Fazlollahtabar, Hamed

doi:10.1080/00207543.2013.848490

Cited by 56 publications

(23 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At the second stage, all m processed components of a job are assembled into a final product on a single assembly machine. Over the past few decades, the TSAFSP has attracted much attention (Tozkapan, Kırca, and Chung 2003;Allahverdi and Al-Anzi 2006a;Allahverdi 2007, 2009;Shokrollahpour, Zandieh, and Dorri 2011;Azadeh et al 2012;Mozdgir et al 2013;Seidgar et al 2014;Yan, Wan, and Xiong 2014; Aydilek 2015) with many practical applications, such as the fire engine assembly plant (Lee, Cheng, and Lin 1993), the personal computer production (Potts et al 1995) and the distributed database system (Allahverdi and Al-Anzi 2006b).…”

Section: Introductionmentioning

confidence: 99%

A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem

Deng

Wang

et al. 2015

International Journal of Production Research

View full text Add to dashboard Cite

This article addresses the distributed two-stage assembly flow-shop scheduling problem (DTSAFSP) with makespan minimisation criterion. A mixed integer linear programming model is presented, and a competitive memetic algorithm (CMA) is proposed. When designing the CMA, a simple encoding scheme is proposed to represent the factory assignment and the job processing sequence; and a ring-based neighbourhood structure is designed for competition and information sharing. Moreover, some knowledge-based local search operators are developed to enhance the exploitation ability. The influence of parameter setting on the CMA is investigated using the analysis of variance method. Extensive computational tests and comparisons are carried out, which demonstrate the effectiveness of the proposed CMA in solving the DTSAFSP.

show abstract

Section: Introductionmentioning

confidence: 99%

A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem

Deng

Wang

et al. 2015

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…It has indeed been found in many real-world industries (Seidgar et al 2014;, including personal computer manufacturing, automobile industry and distributed database systems, etc. In a typical TSAFSP, product components are produced on m parallel machines at the first stage, and then are assembled to final products on an assembly machine at the second stage.…”

Section: Introductionmentioning

confidence: 99%

“…More recently, to further investigate the effectiveness of VNS, Yan, Wan, and Xiong (2014) hybridised VNS with the electromagnetism-like mechanism to guide the search beyond local optima. In addition, Navaei et al (2014) and Seidgar et al (2014) applied the ICA to schedule a two-stage assembly flowshop.…”

Section: Introductionmentioning

confidence: 99%

Coordinated scheduling of production and transportation in a two-stage assembly flowshop

Wang

Luo

et al. 2016

International Journal of Production Research

View full text Add to dashboard Cite

To enhance the overall performance of supply chains, coordination among production and distribution stages has recently received an increasing interest. This paper considers the coordinated scheduling of production and transportation in a two-stage assembly flowshop environment. In this problem, product components are first produced and assembled in a two-stage assembly flowshop, and then completed final products are delivered to a customer in batches. Considering the NP-hard nature of this scheduling problem, two fast heuristics (SPT-based heuristic and LPT-based heuristic) and a new hybrid meta-heuristic (HGA-OVNS) are presented to minimise the weighted sum of average arrival time at the customer and total delivery cost. To guide the search process to more promising areas, the proposed HGA-OVNS integrates genetic algorithm with variable neighbourhood search (VNS) to generate the offspring individuals. Furthermore, to enhance the effectiveness of VNS, the opposition-based learning (OBL) is applied to establish some novel opposite neighbourhood structures. The proposed algorithms are validated on a set of randomly generated instances, and the computation results indicate the superiority of HGA-OVNS in quality of solutions.

show abstract

“…There have been some reports on the applications of imperialist competitive algorithm in solving the scheduling problems by researchers [36][37][38][39][40][41][42]. Thus, based on proper reports of ICA for combinatorial and complicated problems, such as the developed model and appropriate performance of this algorithm, the authors have selected ICA for solving method.…”

Section: Imperialist Competitive Algorithm In Generalmentioning

confidence: 99%

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

2017

View full text Add to dashboard Cite

Abstract. In traditional scheduling problems and many real-world applications, the production operations are scheduled regardless of distribution decisions. Indeed, the completion time of a job in such problems is de ned traditionally as the time when the production sequences of a job are nished. However, in many practical environments, completed orders are delivered to customers immediately after production stages without any further inventory storage. Therefore, in this paper, we investigate an integrated scheduling model of production and distribution problems simultaneously. It is assumed that products proceed through a permutation ow shop scheduling manufacturing system and are delivered to customers via available vehicles. The objective of our integrated model is to minimize the Maximum Returning Time (MRT), which is the time it takes for the last vehicle to deliver the last order to a relevant customer and return to production center. The problem is formulated mathematically, and then an Improved Imperialist Competitive Algorithm (I-ICA) is proposed for solving it. Furthermore, a su cient number of test problems are generated for computational study. Various parameters of the algorithm are analyzed to calibrate the algorithm by means of the Taguchi method. At the end, the e ectiveness of the proposed model and suggested algorithm is evaluated through a computational study where the obtained results show the appropriate performance of the integrated model and solving approach in comparison to those of the other algorithms.

show abstract

An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem

Cited by 56 publications

References 28 publications

A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem

A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem

Coordinated scheduling of production and transportation in a two-stage assembly flowshop

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

Contact Info

Product

Resources

About