In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it is shown that the problem is NP-Hard. Three heuristics will then be developed to solve the problem and a lower bound is also developed for evaluating the performance of the proposed heuristics. Results show that heuristic H3 gives better results compared to the others.
M.R. Amin Naseri, , I. Nakhaee, , & and M. A. Beheshti Nia, (2022). Batch Scheduling in Flexible Flow Shop. Journal of Advanced Materials in Engineering (Esteghlal), 26(2), 41-52.
MLA
M.R. Amin Naseri; I. Nakhaee; and M. A. Beheshti Nia. "Batch Scheduling in Flexible Flow Shop", Journal of Advanced Materials in Engineering (Esteghlal), 26, 2, 2022, 41-52.
HARVARD
M.R. Amin Naseri, , I. Nakhaee, , and M. A. Beheshti Nia, (2022). 'Batch Scheduling in Flexible Flow Shop', Journal of Advanced Materials in Engineering (Esteghlal), 26(2), pp. 41-52.
VANCOUVER
M.R. Amin Naseri, , I. Nakhaee, , and M. A. Beheshti Nia, Batch Scheduling in Flexible Flow Shop. Journal of Advanced Materials in Engineering (Esteghlal), 2022; 26(2): 41-52.
', './data/jame/coversheet/cover_en.jpg'))
