Volume 26, Issue 2 (1-2008)
2008, 26(2): 41-52 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
M.R. Amin Naseri, I. Nakhaee, and M. A. Beheshti Nia. Batch Scheduling in Flexible Flow Shop. Computational Methods in Engineering 2008; 26 (2) :41-52
URL: http://jcme.iut.ac.ir/article-1-434-en.html
URL: http://jcme.iut.ac.ir/article-1-434-en.html
Abstract: (4977 Views)
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.
