Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs

Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs

0.00 Avg rating0 Votes
Article ID: iaor201527187
Volume: 234
Issue: 3
Start Page Number: 650
End Page Number: 657
Publication Date: May 2014
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: combinatorial optimization
Abstract:

We study a two‐machine flowshop scheduling problem with time‐dependent deteriorating jobs, i.e. the processing times of jobs are an increasing function of their starting time. The objective is to minimize the total completion time subject to minimum makespan. We propose a mixed integer programming model, and develop two pairwise interchange algorithms and a branch‐and‐bound procedure to solve the problem while using several dominance conditions to limit the size of the search tree. Several polynomial‐time solvable special cases are discussed. Finally, numerical studies are performed to examine the effectiveness and the efficiency of the proposed algorithms.

Reviews

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