Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

Author： Chung S. H.   Tai Y. T.   Pearn W. L.  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.47, Iss.18, 2009-01, pp. : 5109-5128

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

Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates

By Ozturk Onur  

International Journal of Production Research, Vol. 50, Iss. 20, 2012-10 ,pp. : 6022-6035

Taylor & Francis Ltd

Access to resources Recommend Favorite

Minimising makespan heuristics for scheduling a single batch machine processing machine with non-identical job sizes

By Lee Yoon Ho   Lee Young Hoon  

International Journal of Production Research, Vol. 51, Iss. 12, 2013-06 ,pp. : 3488-3500

Taylor & Francis Ltd

Access to resources Recommend Favorite

Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes

By Kashan A. H.  

International Journal of Production Research, Vol. 44, Iss. 12, 2006-06 ,pp. : 2337-2360

Taylor & Francis Ltd

Access to resources Recommend Favorite

Dynamic scheduling of batch-processing machines with non-identical product sizes

By Van Der Zee D. J.  

International Journal of Production Research, Vol. 45, Iss. 10, 2007-05 ,pp. : 2327-2349

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling a batch processing machine with non-identical job sizes

By Azizoglu M.   Webster S.  

International Journal of Production Research, Vol. 38, Iss. 10, 2000-07 ,pp. : 2173-2184

Taylor & Francis Ltd

Access to resources Recommend Favorite