Minimizing setups for cycle-free ordered sets
Tóm tắt
A machine performs a set of jobs one at a time subject to a set of precedence constraints. We consider the problem of scheduling the jobs to minimize the number of "setups".
Từ khóa
Tài liệu tham khảo
Chaty, G., 1974, Some results about the number of jumps in acircuit digraphs, 267
Chein, Michel, 1972, Sur le nombre de sauts d’une forêt, C. R. Acad. Sci. Paris S\'{e}r. A-B, 275, A159--A161
Chein, M., 1980, The jump number of dags and posets: an introduction, Ann. Discrete Math., 9, 189, 10.1017/s0001867800043305
Cogis, O., 1979, Nombre de sauts et graphes série-parallèles, RAIRO Inform. Th\'{e}or., 13, 3, 10.1051/ita/1979130100031
Dilworth, R. P., 1950, A decomposition theorem for partially ordered sets, Ann. of Math. (2), 51, 161, 10.2307/1969503
J. Kuntzmann and A. Verdillon, Recherche d’un ordre total minimal compatible avec un ordre partial donné, Séminaire Institut de Mathématique de Grenoble, 1971.
W. R. Pulleyblank, On minimizing setups in precedence constrained scheduling, Discrete Appl. Math, (to appear).