Minimizing makespan in a two-machine stochastic flowshop
| dc.contributor.author | Allahverdi, Ali | |
| dc.contributor.author | Aydilek, H. | |
| dc.date.accessioned | 2024-07-12T20:51:26Z | |
| dc.date.available | 2024-07-12T20:51:26Z | |
| dc.date.issued | 2009 | en_US |
| dc.department | Fakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümü | en_US |
| dc.description.abstract | The two-machine flowshop scheduling problem is usually addressed where processing times are assumed to be deterministic for which Johnson’s algorithm can be used to solve the problem. For many scheduling environments, the assumption of deterministic processing times is not valid. Hence, the random variation in processing times has to be taken into account while searching for a solution. Some researchers addressed the flowshop problem where job processing times follow certain probability distributions. For some scheduling environments, it is hard to obtain exact probability distributions for random processing times, and therefore assuming a specific probability distribution is not realistic. Usually, solutions obtained after assuming a certain probability distribution are not even close to the optimal solution. It has been observed that, although the exact probability distribution of job processing times may not be known, upper and lower bounds on job processing times are easy to obtain in many cases. Hence, this information on the bounds of job processing times should be utilized in finding a solution for the scheduling problem. In this paper, we address the two-machine flowshop scheduling problem of minimizing makespan where jobs have random processing times which are bounded between a lower and an upper bound. The probability distributions of job processing times within intervals are not known. The only known information about job processing times are the lower and upper bounds. The decision about a solution of the problem has to be made based on these bounds. Different heuristics using the bounds are proposed, and the proposed heuristics are compared by using simulation. The simulation results have shown that the proposed heuristics perform well with an overall average error of less than one and half percent for all heuristics. One of the heuristics performs as the best with an overall average percentage error of less than one percent. | en_US |
| dc.identifier.citation | Allahverdi, A. ve Aydilek, H. (2009). Minimizing makespan in a two-machine stochastic flowshop. Maltepe Üniversitesi. s. 79. | en_US |
| dc.identifier.endpage | 80 | en_US |
| dc.identifier.isbn | 9.78605E+12 | |
| dc.identifier.startpage | 79 | en_US |
| dc.identifier.uri | https://www.maltepe.edu.tr/Content/Media/CkEditor/03012019014112056-AbstractBookICMS2009Istanbul.pdf#page=76 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12415/2414 | |
| dc.language.iso | en | en_US |
| dc.publisher | Maltepe Üniversitesi | en_US |
| dc.relation.ispartof | International Conference of Mathematical Sciences | en_US |
| dc.relation.publicationcategory | Uluslararası Konferans Öğesi - Başka Kurum Yazarı | en_US |
| dc.rights | CC0 1.0 Universal | * |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.rights.uri | http://creativecommons.org/publicdomain/zero/1.0/ | * |
| dc.snmz | KY07779 | |
| dc.title | Minimizing makespan in a two-machine stochastic flowshop | en_US |
| dc.type | Conference Object | |
| dspace.entity.type | Publication |
