التفاصيل البيبلوغرافية
| العنوان: |
A new heuristic method for solving two machine flow shop with job block, transportation time and final assemble on a single machine without job block. |
| المؤلفون: |
Janaki, E., Ismail, A. Mohamed, kumar, M. Prem |
| المصدر: |
AIP Conference Proceedings; 2024, Vol. 2850 Issue 1, p1-5, 5p |
| مصطلحات موضوعية: |
FLOW shops, MACHINE shops, UNEMPLOYMENT, HEURISTIC, JOB shops |
| مستخلص: |
Processing jobs in different location with minimum completion time and customer's satisfaction is a big task for a production and planning engineers in an industry. In this paper, we propose a new heuristic method for solving flow shop machine with permutation and single machine situated at different locations. To obtain an optimal sequence, we consider a equivalent job for job block on giving a set of jobs processed on first two machines with transportation time by using Johnson's algorithm. To assemble these jobs, we introduce single machine with due date and obtain minimum makespan by using heuristic methods. Numerical examples are given. [ABSTRACT FROM AUTHOR] |
|
Copyright of AIP Conference Proceedings is the property of American Institute of Physics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
Find this article in full text from Scitation.