A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.133, Iss.1-4, 2005-01, pp. : 175-181

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

Lower bounds for on-line single-machine scheduling

By Epstein L. van Stee R.

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 439-450

Elsevier

Access to resources Recommend Favorite

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

By Yuan Jinjiang

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 361-369

Springer Publishing Company

Access to resources Recommend Favorite

On-line scheduling and control of flexible manufacturing cells using automata theory

By Golmakani H.

International Journal of Computer Integrated Manufacturing, Vol. 19, Iss. 2, 2006-03 ,pp. : 178-193

Taylor & Francis Ltd

Access to resources Recommend Favorite

A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems

By Zandieh M.

Journal of Intelligent Manufacturing, Vol. 21, Iss. 6, 2010-12 ,pp. : 731-743

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing Makespan in Batch Machine Scheduling

By Poon Chung Keung Zhang Pixing

Algorithmica, Vol. 39, Iss. 2, 2004-02 ,pp. : 155-174

Springer Publishing Company

Access to resources Recommend Favorite