Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time

Abstract

This article considers the flow shop problem of minimising the total weighted completion time in which the processing times of jobs are variable according to general position weighted learning effects. Two simple heuristics are proposed, and their worst-case error bounds are analysed. In addition, some complex heuristics (including simulated annealing algorithms) and a branch-and-bound algorithm are proposed as solutions to this problem. Finally, computational experiments are performed to examine the effectiveness and efficiency of the proposed algorithms.

Topics & Concepts