Two-machine flowshop scheduling with bicriteria problem

Two-machine flowshop scheduling with bicriteria problem

0.00 Avg rating0 Votes
Article ID: iaor20012305
Country: Netherlands
Volume: 36
Issue: 3
Start Page Number: 549
End Page Number: 564
Publication Date: Jul 1999
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: flowshop
Abstract:

This paper attempts to solve a two-machine flowshop bicriteria scheduling problem with release dates for the jobs, in which the objective function is to minimize a weighed sum of total flow time and makespan. To tackle this scheduling problem, an integer programming model with N2+3N variables and 5N constraints where N is the number of jobs, is formulated. Because of the lengthy computing time and high computing complexity of the integer programming model, a heuristic scheduling algorithm is presented. Experimental results show that the proposed heuristic algorithm can solve this problem rapidly and accurately. The average solution quality of the heuristic algorithm is above 99% and is much better than that of the shortest processing time rule as a benchmark. A 15-job case requires only 0.018 s, on average, to obtain an ultimate or even optimal solution. The heuristic scheduling algorithm is a more practical approach to real world applications than the integer programming model.

Reviews

Required fields are marked *. Your email address will not be published.