| dc.contributor.author | Azizoğlu, M | |
| dc.contributor.author | Çakmak, E | |
| dc.contributor.author | Kondakci, S | |
| dc.date.accessioned | 2019-10-21T20:41:47Z | |
| dc.date.available | 2019-10-21T20:41:47Z | |
| dc.date.issued | 2001 | |
| dc.identifier.issn | 0377-2217 | |
| dc.identifier.issn | 1872-6860 | |
| dc.identifier.uri | https://dx.doi.org/10.1016/S0377-2217(00)00142-9 | |
| dc.identifier.uri | https://hdl.handle.net/11421/20882 | |
| dc.description | WOS: 000169231600004 | en_US |
| dc.description.abstract | In this study, we consider total flow time problem in a flexible flowshop environment. We develop a branch and bound algorithm to find the optimal schedule. The efficiency of the algorithm is enhanced by upper and lower bounds and a dominance criterion. Computational experience reveals that the algorithm solves moderate sized problems in reasonable solution times | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Elsevier Science BV | en_US |
| dc.relation.isversionof | 10.1016/S0377-2217(00)00142-9 | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Flexible Flowshop | en_US |
| dc.subject | Parallel Machines | en_US |
| dc.subject | Total Flow Time | en_US |
| dc.title | A flexible flowshop problem with total flow time minimization | en_US |
| dc.type | article | en_US |
| dc.relation.journal | European Journal of Operational Research | en_US |
| dc.contributor.department | Anadolu Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü | en_US |
| dc.identifier.volume | 132 | en_US |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.startpage | 528 | en_US |
| dc.identifier.endpage | 538 | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US] |
