| dc.contributor.author | Eren, Tamer | |
| dc.date.accessioned | 2020-06-25T17:48:37Z | |
| dc.date.available | 2020-06-25T17:48:37Z | |
| dc.date.issued | 2009 | |
| dc.identifier.issn | 0096-3003 | |
| dc.identifier.uri | https://doi.org/10.1016/j.amc.2008.12.001 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12587/4510 | |
| dc.description | WOS: 000262979600005 | en_US |
| dc.description.abstract | In this study, single machine scheduling problem with unequal release dates and a learning effect is considered. The objective function of the problem is minimization of the total weighted completion time. A non-linear mathematical programming model is developed for the problem which belongs to NP-hard class. Also the model is tested on an example. Results of computational tests show that the proposed model is effective in solving problems with up to 30 jobs. (C) 2008 Elsevier Inc. All rights reserved. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Elsevier Science Inc | en_US |
| dc.relation.isversionof | 10.1016/j.amc.2008.12.001 | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Single machine scheduling | en_US |
| dc.subject | Weighted completion time | en_US |
| dc.subject | Unequal release dates | en_US |
| dc.subject | Learning effect | en_US |
| dc.subject | Non-linear mathematical programming model | en_US |
| dc.title | Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect | en_US |
| dc.type | article | en_US |
| dc.contributor.department | Kırıkkale Üniversitesi | en_US |
| dc.identifier.volume | 208 | en_US |
| dc.identifier.issue | 2 | en_US |
| dc.identifier.startpage | 355 | en_US |
| dc.identifier.endpage | 358 | en_US |
| dc.relation.journal | Applied Mathematics And Computation | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
