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

ISSN： 1862-4472

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

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

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

By Ng C.T. Cheng T.C.E. Yuan J.J. Liu Z.H.

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 323-326

Elsevier

Access to resources Recommend Favorite

The Fuzzy Project Scheduling Problem with Minimal Generalized Precedence Relations

COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, Vol. 1093-9687, Iss. 11, 2015-11 ,pp. : 872-891

John Wiley & Sons Inc

Access to resources Recommend Favorite

The Fuzzy Project Scheduling Problem with Minimal Generalized Precedence Relations

COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, Vol. 30, Iss. 11, 2015-11 ,pp. : 872-891

John Wiley & Sons Inc

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