Document Type


Publication Date


Subject: LCSH

Computer integrated manufacturing systems, Mathematical models


Industrial Engineering | Mechanical Engineering


In this paper, family and job scheduling in a cellular manufacturing shop is addressed where jobs have individual due dates. The objectives are to minimise total tardiness and the number of tardy jobs. Family splitting among cells is allowed but job splitting is not. Two optimisation methods are employed in order to solve this problem, namely mathematical modelling (MM) and genetic algorithm (GA). The results showed that GA found the optimal solution for most of the problems with high frequency. Furthermore, the proposed GA is efficient compared to the MM especially for larger problems in terms of execution times. Other critical aspects of the problem such as family preemption only, impact of family splitting on common due date scenarios and dual objective scenarios are also solved. In short, the proposed comparative approach provides critical insights for the group scheduling problem in a cellular manufacturing shop with distinctive cases.


(C) 2016 Inderscience Publishers. This is the authors' accepted manuscript of the article published in International Journal of Services and Operations Management. The published version can be found at



Publisher Citation

Egilmez, G., Mese, E. M., Erenay, B., & Süer, G. A. (2016). Group scheduling in a cellular manufacturing shop to minimise total tardiness and nT: a comparative genetic algorithm and mathematical modelling approach. International Journal of Services and Operations Management, 24(1), 125-146.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.