An exact approach to minimizing total weighted tardiness with release dates
| dc.citation.epage | 1101 | en_US |
| dc.citation.issueNumber | 11 | en_US |
| dc.citation.spage | 1091 | en_US |
| dc.citation.volumeNumber | 32 | en_US |
| dc.contributor.author | Aktürk, M. S. | en_US |
| dc.contributor.author | Özdemir, D. | en_US |
| dc.date.accessioned | 2016-02-08T10:36:57Z | |
| dc.date.available | 2016-02-08T10:36:57Z | |
| dc.date.issued | 2000 | en_US |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description.abstract | The study deals with scheduling a set of independent jobs with unequal release dates to minimize total weighted tardiness on a single machine. We propose new dominance properties that are incorporated in a branch and bound algorithm. The proposed algorithm is tested on a set of randomly generated problems with 10, 15 and 20 jobs. To the best of our knowledge, this is the first exact approach that attempts to solve the σwjTjproblem. © 2000 "IIE". | en_US |
| dc.identifier.doi | 10.1023/A:1013741325877 | en_US |
| dc.identifier.issn | 0740-817X | |
| dc.identifier.uri | http://hdl.handle.net/11693/24967 | |
| dc.language.iso | English | en_US |
| dc.publisher | Kluwer Academic Publishers | en_US |
| dc.relation.isversionof | https://doi.org/10.1023/A:1013741325877 | en_US |
| dc.source.title | IIE Transactions (Institute of Industrial Engineers) | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Problem solving | en_US |
| dc.subject | Scheduling | en_US |
| dc.subject | Total weighted tardiness | en_US |
| dc.subject | Job analysis | en_US |
| dc.title | An exact approach to minimizing total weighted tardiness with release dates | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- An exact approach to minimizing total weighted tardiness with release dates.pdf
- Size:
- 79.58 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version