Application of tabu search, TS, to solve a flow shopscheduling problem with changeover times in operations:A case study

Abstract

Flow Shop Scheduling (FSS) Problems are NP-hard combinatorial optimization problems. It is quite difficult to achieve an optimal solution for FSS problems with mathematical modelling approaches because of its NP-hard structure. Tabu search (TS), a mega-heuristic algorithm, plays a major role in searching for near-optimal solutions for NP-hard optimization problems. This paper develops a TS model for solving a FSS problem with the objective to reduce total weighted tardiness time, and constraint on changeover time in operations. The performance of the TS model is compared with that of traditional EDD heuristics, being used. The result shows that the objective value has been reduced by 43%, from 215.95 to 123.07 (h). It indicates that the TS model is a good approach for FSS problems.

Authors and Affiliations

Phong Nguyen Nhu Thuy Nhi Nguyen Thi

Keywords

Related Articles

Operations management for public services: Imperatives and implications for empirical research

Operations management (OM) offers immense opportunities for application in the domain of public services. A typical framework of “input-process-output” can also be applied to public services. This theory has evolved with...

A bimodal supply chain game model for apparel enterprises considering consumer channel preferences

Considering the consumer’s channel preference, this paper studies the pricing strategies of clothing manufacturersand retailers mainly selling online on traditional e-commerce platforms and live e-commerce platforms, and...

Vegetable category replenishment and pricing decisionmodel in fresh food supermarkets

The vegetable commodities in fresh food supermarkets generally have the characteristics of a wide variety of categories, different origins, and a short shelf life. Moreover, the product quality continuously deteriorates...

Further discussion on regulations of the logistic servicesin Vietnam–and construction issues for logistics in Ca Mauprovince

Purpose: This research paper aims to present discussion on regulations of the logistic services in Vietnam and a case study of logistics in Ca Mau province. By using the panel approach, our findings: As the role of logis...

Application of genetic algorithm, GA, to solve a flow shop scheduling problem with changeover times in operations: a case study

Flow Shop Scheduling (FSS) Problems are examples of combinatorial optimization issues that are classified as NP-hard.Becauseof theNP-hardstructureofFSS problems,itcanbeextremelychallenging tofindmathematica...

Download PDF file
  • EP ID EP743576
  • DOI 10.54646/bijomrp.2024.22
  • Views 42
  • Downloads 0

How To Cite

Phong Nguyen Nhu Thuy Nhi Nguyen Thi (2024). Application of tabu search, TS, to solve a flow shopscheduling problem with changeover times in operations:A case study. BOHR International Journal of Operations Management Research and Practices, 3(1), -. https://europub.co.uk/articles/-A-743576