Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds-Reference-Cited by-同舟云学术

Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds

Published:1995 Issue: Volume: Page:307-320
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Queyranne Maurice,Schulz Andreas S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-59408-6_60.pdf

Reference26 articles.

1. A. von Arnim and R. Schrader, The permutahedron of P 4-sparse posets, to appear in Discrete Applied Mathematics.

2. A. von Arnim and A. S. Schulz, Facets of the generalized permutahedron of a poset, Preprint 386/1994, Department of Mathematics, Technical University of Berlin, Berlin, Germany, 1994, to appear in Discrete Applied Mathematics.

3. E. Balas, A linear characterization of permutation vectors, Management Science Research Report 364, Carnegie Mellon University, Pittsburgh, USA, 1975.

4. -, On the facial structure of scheduling polyhedra, Mathematical Programming Study 24 (1985), 179–218.

5. J. L. Bruno, E. G. Coffman Jr., and R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications of the ACM 17 (1974), 382–387.

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

1. Considering the game-theoretic approach and ultra combinative costs on scheduling;The International Journal of Advanced Manufacturing Technology;2013-10-23

2. Sharing Supermodular Costs;Operations Research;2010-08

3. Increasing Speed Scheduling and Flow Scheduling;Algorithms and Computation;2010

4. Encouraging Cooperation in Sharing Supermodular Costs;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2007

5. Encouraging Cooperation in Sharing Supermodular Costs;SSRN Electronic Journal;2007