| Article ID: | iaor20013323 |
| Country: | Lithuania |
| Volume: | 12 |
| Issue: | 1 |
| Start Page Number: | 61 |
| End Page Number: | 68 |
| Publication Date: | Jan 2001 |
| Journal: | Informatica |
| Authors: | Janiak Adam, Shafransky Yakov, Tuzikov Alexander |
| Keywords: | programming: multiple criteria |
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.