Project scheduling with irregular costs: complexity, approximability, and algorithms

Author： Grigoriev Alexander   Woeginger Gerhard  

Publisher： Springer Publishing Company

ISSN： 0001-5903

Source： Acta Informatica, Vol.41, Iss.2-3, 2004-12, pp. : 83-97

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

Related content

Scheduling in Reentrant Robotic Cells: Algorithms and Complexity

By Steiner George   Xue Zhihui  

Journal of Scheduling, Vol. 8, Iss. 1, 2005-01 ,pp. : 25-48

Springer Publishing Company

Access to resources Recommend Favorite

Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm

By Achuthan N.R.   Hardjawidjaja A.  

Annals of Operations Research, Vol. 108, Iss. 1-4, 2001-11 ,pp. : 55-74

Springer Publishing Company

Access to resources Recommend Favorite

Problem space search algorithms for resource-constrained project scheduling

By Naphade K.S.   David Wu S.   Storer R.H.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 307-326

Springer Publishing Company

Access to resources Recommend Favorite

The complexity and approximability of finding maximum feasible subsystems of linear relations

By Amaldi E.   Kann V.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 181-210

Elsevier

Access to resources Recommend Favorite

On the Complexity of Adjacent Resource Scheduling

By Duin C.   Sluis E.  

Journal of Scheduling, Vol. 9, Iss. 1, 2006-02 ,pp. : 49-62

Springer Publishing Company

Access to resources Recommend Favorite