Stochastic scheduling of a batch processing machine with incompatible job families

ISSN： 0254-5330

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

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

A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families

By Tangudu S. K. Kurz M. E.

Production Planning and Control, Vol. 17, Iss. 7, 2006-10 ,pp. : 728-741

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling algorithms for heterogeneous batch processors with incompatible job-families: Applied Intelligent Heuristics for Responsive Manufacturing (Guest Editors: Turkay Dereli and Adil Baykasoglu)

By Mathirajan M. Sivakumar A. I. Chandru V.

Journal of Intelligent Manufacturing, Vol. 15, Iss. 6, 2004-12 ,pp. : 787-803

Springer Publishing Company

Access to resources Recommend Favorite

On the complexity of bi-criteria scheduling on a single batch processing machine

By Liu L.

Journal of Scheduling, Vol. 13, Iss. 6, 2010-12 ,pp. : 629-638

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

Weighted nested partitions based on differential evolution (WNPDE) algorithm-based scheduling of parallel batching processing machines (BPM) with incompatible families and dynamic lot arrival

By Su Guojun Wang Xionghai

International Journal of Computer Integrated Manufacturing, Vol. 24, Iss. 6, 2011-06 ,pp. : 552-560

Taylor & Francis Ltd

Access to resources Recommend Favorite