On the complexity of scheduling with large communication delays

Author： Bampis E. Giannakos A. Konig J.-C.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.94, Iss.2, 1996-10, pp. : 252-260

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Complexity of mixed shop scheduling problems: A survey

By Shakhlevich N.V. Sotskov Y.N. Werner F.

European Journal of Operational Research, Vol. 120, Iss. 2, 2000-01 ,pp. : 343-351

Elsevier

Access to resources Recommend Favorite

Scheduling in robotic cells: complexity and steady state analysis

By Hall N.G. Kamoun H. Sriskandarajah C.

European Journal of Operational Research, Vol. 109, Iss. 1, 1998-08 ,pp. : 43-65

Elsevier

Access to resources Recommend Favorite

The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability

By Bruggemann W. Jahnke H.

European Journal of Operational Research, Vol. 124, Iss. 3, 2000-08 ,pp. : 511-528

Elsevier

Access to resources Recommend Favorite

The complexity of a cyclic scheduling problem with identical machines and precedence constraints

By Munier A.

European Journal of Operational Research, Vol. 91, Iss. 3, 1996-06 ,pp. : 471-480

Elsevier

Access to resources Recommend Favorite

A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs

By Jinjiang Y.

European Journal of Operational Research, Vol. 94, Iss. 1, 1996-10 ,pp. : 203-205

Elsevier

Access to resources Recommend Favorite