A note on the complexity of the problem of two-agent scheduling on a single machine

Author： Ng C.   Cheng T.   Yuan J.  

Publisher： Springer Publishing Company

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.12, Iss.4, 2006-12, pp. : 387-394

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

A Generalized Two-Agent Location Problem: Asymmetric Dynamics and Coordination

By Golany Boaz   Kogan Konstantin   Rothblum Uriel  

Journal of Optimization Theory and Applications, Vol. 148, Iss. 2, 2011-02 ,pp. : 336-363

Springer Publishing Company

Access to resources Recommend Favorite

A GRASP based on DE to solve single machine scheduling problem with SDST

By Akrout Hanen  

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 411-435

Springer Publishing Company

Access to resources Recommend Favorite

The single machine ready time scheduling problem with fuzzy processing times

By Wang  

Fuzzy Sets and Systems, Vol. 127, Iss. 2, 2002-04 ,pp. : 117-129

Elsevier

Access to resources Recommend Favorite

On a single machine-scheduling problem with separated position and resource effects

By  

Optimization, Vol. 64, Iss. 4, 2015-04 ,pp. : 909-911

Taylor & Francis Ltd

Access to resources Recommend Favorite

Two-dedicated-machine scheduling problem with precedence relations to minimize makespan

By Gafarov Evgeny   Dolgui Alexandre  

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1443-1451

Springer Publishing Company

Access to resources Recommend Favorite