Minimizing setups for cycle-free ordered sets-Reference-Cited by-同舟云学术

Minimizing setups for cycle-free ordered sets

Published:1982 Issue:4 Volume:85 Page:509-513
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Duffus D.,Rival I.,Winkler P.

Abstract

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".

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1982-085-04/S0002-9939-1982-0660592-3/S0002-9939-1982-0660592-3.pdf

Reference7 articles.

1. Some results about the number of jumps in acircuit digraphs;Chaty, G.,1974

2. Sur le nombre de sauts d’une forêt;Chein, Michel;C. R. Acad. Sci. Paris S\'{e}r. A-B,1972

3. The jump number of dags and posets: an introduction;Chein, M.;Ann. Discrete Math.,1980

4. Nombre de sauts et graphes série-parallèles;Cogis, O.;RAIRO Inform. Th\'{e}or.,1979

5. A decomposition theorem for partially ordered sets;Dilworth, R. P.;Ann. of Math. (2),1950

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scheduling with few changes;European Journal of Operational Research;2014-07

2. Minimizing the maximum bump cost in linear extensions of a poset;Journal of Combinatorial Optimization;2012-02-17

3. The Arboreal Jump Number of an Order;Order;2012-01-28

4. Minimizing the sum cost in linear extensions of a poset;Journal of Combinatorial Optimization;2009-05-29

5. A polynomially solvable case of optimal linear extension problem of a poset;Journal of Combinatorial Optimization;2009-02-24