Pub. online:1 Jan 2001Type:Research ArticleOpen Access
Volume 12, Issue 1 (2001), pp. 61–88
Multicriteria sequencing problems with criteria ordered according to their importance are considered. Additional precedence and group technology constraints are imposed. We introduce a notion of a priority-generating vector function and suggest general techniques that form a base for the construction of polynomial time algorithms for numerous sequencing problems including all known polynomially solvable problems. A comprehensive survey of results for sequencing problems with ordered criteria is given as well.