A bi-criteria two-machine flowshop scheduling problem with a learning effect

Abstract

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)
DOI: 10.1057/palgrave.jors.2602095

Topics

2 Figures and Tables

Cite this paper

@article{Chen2006ABT, title={A bi-criteria two-machine flowshop scheduling problem with a learning effect}, author={P. Chen and C.-C. Wu and W.-C. Lee}, journal={JORS}, year={2006}, volume={57}, pages={1113-1125} }