| dc.contributor.author | Eren, Tamer | |
| dc.contributor.author | Guener, Ertan | |
| dc.date.accessioned | 2020-06-25T17:43:49Z | |
| dc.date.available | 2020-06-25T17:43:49Z | |
| dc.date.issued | 2007 | |
| dc.identifier.issn | 0315-5986 | |
| dc.identifier.issn | 1916-0615 | |
| dc.identifier.uri | https://doi.org10.3138/infor.45.2.75 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12587/3908 | |
| dc.description | WOS: 000257231600003 | en_US |
| dc.description.abstract | This paper considers a bicriteria scheduling problem with a learning effect on a single machine to minimize a weighted sum of total completion time and total tardiness. A mathematical programming model is developed for the problem, and optimal solutions are only obtained up to 25 jobs. Since the problem is NP-hard, heuristic methods based on tabu search and random search are proposed to solve large size problems, and their effectiveness is comparatively investigated considering 3600 problems. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Taylor & Francis Inc | en_US |
| dc.relation.isversionof | 10.3138/infor.45.2.75 | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | single machine scheduling | en_US |
| dc.subject | bicriteria scheduling | en_US |
| dc.subject | learning effect | en_US |
| dc.subject | mathematical programming | en_US |
| dc.subject | heuristic method | en_US |
| dc.subject | tabu search | en_US |
| dc.title | A bicriteria scheduling problem with a learning effect: Total completion time and total tardiness | en_US |
| dc.type | article | en_US |
| dc.identifier.volume | 45 | en_US |
| dc.identifier.issue | 2 | en_US |
| dc.identifier.startpage | 75 | en_US |
| dc.identifier.endpage | 81 | en_US |
| dc.relation.journal | Infor | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
