Analysis of dispatching rules application on scheduling problem in flexible-flow shop production
In this paper we analyzed a group of simple heuristic methods, which are used for solving the scheduling problem in manufacturing and services. The analysis was performed on the scheduling problem in a flexible-flow shop production, which is known by the English term - Flexible-Flow Shop (FFS). The...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Savez inženjera i tehničara Srbije
2014-01-01
|
| Series: | Tehnika |
| Subjects: | |
| Online Access: | http://scindeks-clanci.ceon.rs/data/pdf/0040-2176/2014/0040-21761403507R.pdf |
| _version_ | 1818418596349476864 |
|---|---|
| author | Rakićević Zoran M. Vujošević Mirko B. |
| author_facet | Rakićević Zoran M. Vujošević Mirko B. |
| author_sort | Rakićević Zoran M. |
| collection | DOAJ |
| description | In this paper we analyzed a group of simple heuristic methods, which are used for solving the scheduling problem in manufacturing and services. The analysis was performed on the scheduling problem in a flexible-flow shop production, which is known by the English term - Flexible-Flow Shop (FFS). The task is to determine the schedule of processing multiple products on multiple machines, where all the products have the same sequence of processing and for each process there are multiple machines available. For this FFS problem we present the corresponding mathematical model of mixed integer programming. Among potential methods for solving the set task, we consider simple heuristics because the original scheduling problem is NP-hard and finding the exact optimal solution would require unacceptably long computing time. Heuristic methods are based on priority rules that are performed based on the relations of importance between products and their processing time on individual machines. Heuristic methods are widely used for solving practical problems, which was the motivation for the analysis performed in this paper. The aim of the analysis is to identify those priority rules, from a set of considered, which provide a good solution to a hypothetical scheduling problem example, where the evaluation of solution is performed using different criteria functions. The analysis that is presented in the paper was obtained by using the computer program LEKIN. The main results of the analysis indicated that priority rules give different solutions to the problem of FFS and that each of these solutions is a significantly good result in terms of some of the considered criteria functions. |
| first_indexed | 2024-12-14T12:25:11Z |
| format | Article |
| id | doaj.art-93bc941608814d2bbaa17ee4c2a68134 |
| institution | Directory Open Access Journal |
| issn | 0040-2176 2560-3086 |
| language | English |
| last_indexed | 2024-12-14T12:25:11Z |
| publishDate | 2014-01-01 |
| publisher | Savez inženjera i tehničara Srbije |
| record_format | Article |
| series | Tehnika |
| spelling | doaj.art-93bc941608814d2bbaa17ee4c2a681342022-12-21T23:01:21ZengSavez inženjera i tehničara SrbijeTehnika0040-21762560-30862014-01-0169350751310.5937/tehnika1403507R0040-21761403507RAnalysis of dispatching rules application on scheduling problem in flexible-flow shop productionRakićević Zoran M.0Vujošević Mirko B.1University of Belgrade, Faculty of Organizational Sciences, Belgrade, SerbiaUniversity of Belgrade, Faculty of Organizational Sciences, Belgrade, SerbiaIn this paper we analyzed a group of simple heuristic methods, which are used for solving the scheduling problem in manufacturing and services. The analysis was performed on the scheduling problem in a flexible-flow shop production, which is known by the English term - Flexible-Flow Shop (FFS). The task is to determine the schedule of processing multiple products on multiple machines, where all the products have the same sequence of processing and for each process there are multiple machines available. For this FFS problem we present the corresponding mathematical model of mixed integer programming. Among potential methods for solving the set task, we consider simple heuristics because the original scheduling problem is NP-hard and finding the exact optimal solution would require unacceptably long computing time. Heuristic methods are based on priority rules that are performed based on the relations of importance between products and their processing time on individual machines. Heuristic methods are widely used for solving practical problems, which was the motivation for the analysis performed in this paper. The aim of the analysis is to identify those priority rules, from a set of considered, which provide a good solution to a hypothetical scheduling problem example, where the evaluation of solution is performed using different criteria functions. The analysis that is presented in the paper was obtained by using the computer program LEKIN. The main results of the analysis indicated that priority rules give different solutions to the problem of FFS and that each of these solutions is a significantly good result in terms of some of the considered criteria functions.http://scindeks-clanci.ceon.rs/data/pdf/0040-2176/2014/0040-21761403507R.pdfSchedulingflow shopflexible-flow shop (FFS)dispatching (priority) rules |
| spellingShingle | Rakićević Zoran M. Vujošević Mirko B. Analysis of dispatching rules application on scheduling problem in flexible-flow shop production Tehnika Scheduling flow shop flexible-flow shop (FFS) dispatching (priority) rules |
| title | Analysis of dispatching rules application on scheduling problem in flexible-flow shop production |
| title_full | Analysis of dispatching rules application on scheduling problem in flexible-flow shop production |
| title_fullStr | Analysis of dispatching rules application on scheduling problem in flexible-flow shop production |
| title_full_unstemmed | Analysis of dispatching rules application on scheduling problem in flexible-flow shop production |
| title_short | Analysis of dispatching rules application on scheduling problem in flexible-flow shop production |
| title_sort | analysis of dispatching rules application on scheduling problem in flexible flow shop production |
| topic | Scheduling flow shop flexible-flow shop (FFS) dispatching (priority) rules |
| url | http://scindeks-clanci.ceon.rs/data/pdf/0040-2176/2014/0040-21761403507R.pdf |
| work_keys_str_mv | AT rakiceviczoranm analysisofdispatchingrulesapplicationonschedulingprobleminflexibleflowshopproduction AT vujosevicmirkob analysisofdispatchingrulesapplicationonschedulingprobleminflexibleflowshopproduction |