Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.48, Iss.2, 2011-03, pp. : 399-421

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

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

Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan

By Li Shisheng Yuan Jinjiang

Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. : 84-93

Springer Publishing Company

Access to resources Recommend Favorite

Randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors

By Du Dong-lei

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 3, 2005-08 ,pp. : 485-488

Springer Publishing Company

Access to resources Recommend Favorite

A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems

By Frangioni Antonio Necciari Emiliano Scutellà Maria Grazia

Journal of Combinatorial Optimization, Vol. 8, Iss. 2, 2004-06 ,pp. : 195-220

Springer Publishing Company

Access to resources Recommend Favorite

A fuzzy project scheduling approach to minimize schedule risk for product development

By Wang J.

Fuzzy Sets and Systems, Vol. 127, Iss. 2, 2002-04 ,pp. : 99-116

Elsevier

Access to resources Recommend Favorite