Learn More
This paper addresses a bi-criteria two-machine flowshop scheduling problem when the learning effect is present. The objective is to find a sequence that minimizes a weighted sum of the total completion time and the maximum tardiness. In this article, a branch-and-bound method, incorporating several dominance properties and a lower bound, is presented to(More)
The learning effects are widely studied in scheduling problems recently. Biskup [1] classified the learning effect models into two diverse approaches, namely the position-based and the sum-of-processing-time-based learning effect models. He further claimed that the position-based learning effect model seems to be a realistic assumption for the case that the(More)