A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity
We can make optimum scheduling results using various methods that are proposed by many researchers. However, it is very difficult to process the works on time without delaying the schedule. There are two major causes that disturb the planned optimum schedules; they are (1)the variation of productive...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
International Institute of Informatics and Cybernetics
2005-02-01
|
| Series: | Journal of Systemics, Cybernetics and Informatics |
| Subjects: | |
| Online Access: | http://www.iiisci.org/Journal/CV$/sci/pdfs/P686773.pdf
|
| _version_ | 1819204223168937984 |
|---|---|
| author | Kenzo KURIHARA Yusuke OWADA Yann-liang LI Kazuaki MASUDA Nobuyuki NISHIUCHI |
| author_facet | Kenzo KURIHARA Yusuke OWADA Yann-liang LI Kazuaki MASUDA Nobuyuki NISHIUCHI |
| author_sort | Kenzo KURIHARA |
| collection | DOAJ |
| description | We can make optimum scheduling results using various methods that are proposed by many researchers. However, it is very difficult to process the works on time without delaying the schedule. There are two major causes that disturb the planned optimum schedules; they are (1)the variation of productive capacity, and (2)the variation of products' quantities themselves. In this paper, we deal with the former variation, or productive capacities, at flow-shop works. When production machines in a shop go out of order at flow-shops, we cannot continue to operate the productions and we have to stop the production line. To the contrary, we can continue to operate the shops even if some workers absent themselves. Of course, in this case, the production capacities become lower, because workers need to move from a machine to another to overcome the shortage of workers and some shops cannot be operated because of the worker shortage. We developed a new re-scheduling method based on Branch-and Bound method. We proposed an equation for calculating the lower bound for our Branch-and Bound method in a practical time. Some evaluation experiments are done using practical data of real flow-shop works. We compared our results with those of another simple scheduling method, and we confirmed the total production time of our result is shorter than that of another method by 4%. |
| first_indexed | 2024-12-23T04:32:23Z |
| format | Article |
| id | doaj.art-44496e193a9e4bd6b439f0a1426290e6 |
| institution | Directory Open Access Journal |
| issn | 1690-4524 |
| language | English |
| last_indexed | 2024-12-23T04:32:23Z |
| publishDate | 2005-02-01 |
| publisher | International Institute of Informatics and Cybernetics |
| record_format | Article |
| series | Journal of Systemics, Cybernetics and Informatics |
| spelling | doaj.art-44496e193a9e4bd6b439f0a1426290e62022-12-21T17:59:58ZengInternational Institute of Informatics and CyberneticsJournal of Systemics, Cybernetics and Informatics1690-45242005-02-01311824A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive CapacityKenzo KURIHARA0Yusuke OWADA1Yann-liang LI2Kazuaki MASUDA3Nobuyuki NISHIUCHI4 Department of Industrial Engineering and Management, Kanagawa University Department of Industrial Engineering and Management, Kanagawa University Department of Industrial Engineering and Management, Kanagawa University Department of Industrial Engineering and Management, Kanagawa University Faculty of System Design, Tokyo Metropolitan University We can make optimum scheduling results using various methods that are proposed by many researchers. However, it is very difficult to process the works on time without delaying the schedule. There are two major causes that disturb the planned optimum schedules; they are (1)the variation of productive capacity, and (2)the variation of products' quantities themselves. In this paper, we deal with the former variation, or productive capacities, at flow-shop works. When production machines in a shop go out of order at flow-shops, we cannot continue to operate the productions and we have to stop the production line. To the contrary, we can continue to operate the shops even if some workers absent themselves. Of course, in this case, the production capacities become lower, because workers need to move from a machine to another to overcome the shortage of workers and some shops cannot be operated because of the worker shortage. We developed a new re-scheduling method based on Branch-and Bound method. We proposed an equation for calculating the lower bound for our Branch-and Bound method in a practical time. Some evaluation experiments are done using practical data of real flow-shop works. We compared our results with those of another simple scheduling method, and we confirmed the total production time of our result is shorter than that of another method by 4%.http://www.iiisci.org/Journal/CV$/sci/pdfs/P686773.pdf Flow-Shop SchedulingVariation of Productive CapacityBranch-And-Bound Method |
| spellingShingle | Kenzo KURIHARA Yusuke OWADA Yann-liang LI Kazuaki MASUDA Nobuyuki NISHIUCHI A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity Journal of Systemics, Cybernetics and Informatics Flow-Shop Scheduling Variation of Productive Capacity Branch-And-Bound Method |
| title | A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity |
| title_full | A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity |
| title_fullStr | A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity |
| title_full_unstemmed | A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity |
| title_short | A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity |
| title_sort | method of flow shop re scheduling dealing with variation of productive capacity |
| topic | Flow-Shop Scheduling Variation of Productive Capacity Branch-And-Bound Method |
| url | http://www.iiisci.org/Journal/CV$/sci/pdfs/P686773.pdf
|
| work_keys_str_mv | AT kenzokurihara amethodofflowshopreschedulingdealingwithvariationofproductivecapacity AT yusukeowada amethodofflowshopreschedulingdealingwithvariationofproductivecapacity AT yannliangli amethodofflowshopreschedulingdealingwithvariationofproductivecapacity AT kazuakimasuda amethodofflowshopreschedulingdealingwithvariationofproductivecapacity AT nobuyukinishiuchi amethodofflowshopreschedulingdealingwithvariationofproductivecapacity AT kenzokurihara methodofflowshopreschedulingdealingwithvariationofproductivecapacity AT yusukeowada methodofflowshopreschedulingdealingwithvariationofproductivecapacity AT yannliangli methodofflowshopreschedulingdealingwithvariationofproductivecapacity AT kazuakimasuda methodofflowshopreschedulingdealingwithvariationofproductivecapacity AT nobuyukinishiuchi methodofflowshopreschedulingdealingwithvariationofproductivecapacity |