Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes

By Cheng Bayi   Yang Shanlin   Hu Xiaoxuan   Li Kai  

International Journal of Systems Science, Vol. 45, Iss. 3, 2014-03 ,pp. : 571-578

Taylor & Francis Ltd

Access to resources Recommend Favorite

Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan

By Wang Ji-Bo  

The International Journal of Advanced Manufacturing Technology, Vol. 48, Iss. 5-8, 2010-05 ,pp. : 719-723

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing

By Melouk S.   Damodaran P.   Chang P.-Y.  

International Journal of Production Economics, Vol. 87, Iss. 2, 2004-01 ,pp. : 141-147

Elsevier

Access to resources Recommend Favorite

Minimizing the total flow time and the tardiness in a two-machine flow shop

By Lee Wen-Chiung   Wu Chin-Chia  

International Journal of Systems Science, Vol. 32, Iss. 3, 2001-03 ,pp. : 365-373

Taylor & Francis Ltd

Access to resources Recommend Favorite

Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times

By Damodaran Purushothaman   Velez-Gallego Mario  

The International Journal of Advanced Manufacturing Technology, Vol. 49, Iss. 9-12, 2010-08 ,pp. : 1119-1128

Springer Publishing Company

Access to resources Recommend Favorite