Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion

Janiak, Adam, Kozan, Erhan, Lichtenstein, Maciej, & Oguz, Cedya (2007) Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics, 105(2), p. 407.

View at publisher


In the paper, the flow-shop scheduling problem with parallel machines at each stage (machine center) is studied. For each job its release and due date as well as a processing time for its each operation are given. The scheduling criterion consists of three parts: the total weighted earliness, the total weighted tardiness and the total weighted waiting time. The criterion takes into account the costs of storing semi-manufactured products in the course of production and ready-made products as well as penalties for not meeting the deadlines stated in the conditions of the contract with customer. To solve the problem, three constructive algorithms and three metaheuristics (based one Tabu Search and Simulated Annealing techniques) are developed and experimentally analyzed. All the proposed algorithms operate on the notion of so-called operation processing order, i.e. the order of operations on each machine. We show that the problem of schedule construction on the base of a given operation processing order can be reduced to the linear programming task. We also propose some approximation algorithm for schedule construction and show the conditions of its optimality.

Impact and interest:

78 citations in Scopus
Search Google Scholar™
70 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 31863
Item Type: Journal Article
Refereed: Yes
Keywords: scheduling, Flow shop, Tabu search, Simulated annealing
DOI: 10.1016/j.ijpe.2004.05.027
ISSN: 09255273
Subjects: Australian and New Zealand Standard Research Classification > COMMERCE MANAGEMENT TOURISM AND SERVICES (150000) > BUSINESS AND MANAGEMENT (150300)
Australian and New Zealand Standard Research Classification > ECONOMICS (140000) > APPLIED ECONOMICS (140200)
Divisions: Past > QUT Faculties & Divisions > Faculty of Science and Technology
Past > Schools > Mathematical Sciences
Deposited On: 20 Apr 2010 00:38
Last Modified: 29 Feb 2012 13:20

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page