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

ISSN： 0168-9673

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

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

Randomized on-line scheduling on three processors

By Tichy T.V.

Operations Research Letters, Vol. 32, Iss. 2, 2004-03 ,pp. : 152-158

Elsevier

Access to resources Recommend Favorite

Scheduling Equal-Length Jobs with Delivery times on Identical Processors

By Vakhania Nodari

International Journal of Computer Mathematics, Vol. 79, Iss. 6, 2002-01 ,pp. : 715-728

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

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

Semi-online scheduling on two identical machines with rejection

By Min Xiao Wang Yuqing Liu Jing Jiang Min

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 472-479

Springer Publishing Company

Access to resources Recommend Favorite