Volume 39, Issue 1 (8-2020)
2020, 39(1): 105-133 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Fattahi N, Reisi-Nafchi M, Moslehi G. Minimizing Total Weighted Tardiness in a Flexible Flowshop Environment Considering Batch Processing Machines. Computational Methods in Engineering 2020; 39 (1) :105-133
URL: http://jcme.iut.ac.ir/article-1-773-en.html
URL: http://jcme.iut.ac.ir/article-1-773-en.html
1- Department of Industrial and Systems Engineering, Isfahan University of Technology, Iran.
2- Department of Industrial and Systems Engineering, Isfahan University of Technology, Iran. , reisi.m@iut.ac.ir
2- Department of Industrial and Systems Engineering, Isfahan University of Technology, Iran. , reisi.m@iut.ac.ir
Abstract: (2293 Views)
Scheduling in production environments is used as a competitive tool to improve efficiency and respond to customer requests. In this paper, a scheduling problem is investigated in a three-stage flexible flowshop environment with the consideration of blocking and batch processing. This problem has been inspired by the charging and packaging line of a large battery manufacturer. In this environment, the first and third stages involve a single processor machine, and the second one consists of m identical parallel batch processing machines. The objective is to minimize the total weighted tardiness of the received orders.Given the lack of consideration of this problem in the literature, first, a mathematical programming model is presented for the problem. Also, due to the NP-hardness of the problem, a variable neighborhood search algorithm and a memetic algorithm are developed to solve it. The computational results show that the variable neighborhood search algorithm can solve instances up to 1200 orders and 15 machines with an average deviation of about 1.9%, relative to the best solution of the two algorithms, and the memetic algorithm can solve instances up to 1200 orders and 15 machines with an average deviation of about 7.8%, as compared e to the best solution of the two algorithms. In general, computational results show the better performance of the variable neighborhood search algorithm in comparison to the memetic algorithm.
Keywords: Scheduling, Fexible flowshp, blocking, Batch processing, Variable neighbourhood search algorithm, Memetic algorithm
Type of Study: Research |
Subject:
Special
Received: 2019/01/9 | Accepted: 2019/06/1 | Published: 2020/08/31
Received: 2019/01/9 | Accepted: 2019/06/1 | Published: 2020/08/31
Send email to the article author
