Related content

Makespan minimization in online scheduling with machine eligibility

By Lee Kangbok  

Annals of Operations Research, Vol. 204, Iss. 1, 2013-04 ,pp. : 189-222

Springer Publishing Company

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

Stochastic scheduling of a batch processing machine with incompatible job families

By Duenyas I.   Neale J.J.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 191-220

Springer Publishing Company

Access to resources Recommend Favorite

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

By Poon Chung  

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

Springer Publishing Company

Access to resources Recommend Favorite

Single machine scheduling with batch set-up times to minimize maximum lateness

By Hariri A.M.A.   Potts C.N.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 75-92

Springer Publishing Company

Access to resources Recommend Favorite