Distributed permutation flowshop scheduling problem with total completion time objective

Arshad Ali (), Yuvraj Gajpal () and Tarek Y. Elmekkawy ()
Additional contact information
Arshad Ali: University of Manitoba
Yuvraj Gajpal: University of Manitoba
Tarek Y. Elmekkawy: Qatar University

OPSEARCH, 2021, vol. 58, issue 2, No 7, 425-447

Abstract: Abstract This paper considers the distributed permutation flowshop scheduling problem (DPFSP) which is an extension of permutation flowshop scheduling problem (PFSP). In DPFSP, there are multiple parallel factories instead of one factory as in PFSP. Each factory consists of same number of machines, and jobs can be processed in either of the factories to perform all necessary operations. This paper considers DPFSP for minimizing the total completion time objective. An MILP formulation is developed to find the optimal solution. To solve the problem, a metaheuristic, tabu search (TS) is proposed. Numerical experiments are performed on benchmark problem instances from the literature, and results of the proposed method are compared with current metaheuristics in the literature for this problem. The tabu search outperforms all existing metaheuristics in terms of solution quality.

Keywords: Parallel flowshop; Distributed permutation flowshop; Tabu search; Total completion time; Scheduling; Metaheuristics (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s12597-020-00484-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:opsear:v:58:y:2021:i:2:d:10.1007_s12597-020-00484-3

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-020-00484-3

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().