A rescheduling heuristic for the single machine total tardiness problem
| dc.contributor.author | Nyirenda, J C | |
| dc.date.accessioned | 2017-06-26T09:45:32Z | |
| dc.date.available | 2017-06-26T09:45:32Z | |
| dc.date.issued | 2006 | |
| dc.date.updated | 2016-01-11T09:43:09Z | |
| dc.description.abstract | In this paper, we propose a rescheduling heuristic for scheduling N jobs on a single machine in order to minimise total tardiness. The heuristic is of the interchange type and constructs a schedule from the modified due date (MDD) schedule. Unlike most interchange heuristics that consider interchanges involving only two jobs at a time, the newly proposed heuristic uses interchanges that may involve more than two jobs at any one time. Experimental results show that the heuristic is effective at reducing total tardiness producing schedules that either similar or better than those produced by the MDD alone. Furthermore, when applied to some test problems the heuristic found optimal schedules to all of them. | |
| dc.identifier | http://dx.doi.org/10.5784/22-1-34 | |
| dc.identifier.apacitation | Nyirenda, J. C. (2006). A rescheduling heuristic for the single machine total tardiness problem. <i>ORION: Operations Research in South Africa</i>, http://hdl.handle.net/11427/24635 | en_ZA |
| dc.identifier.chicagocitation | Nyirenda, J C "A rescheduling heuristic for the single machine total tardiness problem." <i>ORION: Operations Research in South Africa</i> (2006) http://hdl.handle.net/11427/24635 | en_ZA |
| dc.identifier.citation | Nyirenda, J. C. (2006). A rescheduling heuristic for the single machine total tardiness problem. ORiON: The Journal of ORSSA, 22(1), 77-87. | |
| dc.identifier.ris | TY - Journal Article AU - Nyirenda, J C AB - In this paper, we propose a rescheduling heuristic for scheduling N jobs on a single machine in order to minimise total tardiness. The heuristic is of the interchange type and constructs a schedule from the modified due date (MDD) schedule. Unlike most interchange heuristics that consider interchanges involving only two jobs at a time, the newly proposed heuristic uses interchanges that may involve more than two jobs at any one time. Experimental results show that the heuristic is effective at reducing total tardiness producing schedules that either similar or better than those produced by the MDD alone. Furthermore, when applied to some test problems the heuristic found optimal schedules to all of them. DA - 2006 DB - OpenUCT DP - University of Cape Town J1 - ORION: Operations Research in South Africa LK - https://open.uct.ac.za PB - University of Cape Town PY - 2006 T1 - A rescheduling heuristic for the single machine total tardiness problem TI - A rescheduling heuristic for the single machine total tardiness problem UR - http://hdl.handle.net/11427/24635 ER - | en_ZA |
| dc.identifier.uri | http://hdl.handle.net/11427/24635 | |
| dc.identifier.vancouvercitation | Nyirenda JC. A rescheduling heuristic for the single machine total tardiness problem. ORION: Operations Research in South Africa. 2006; http://hdl.handle.net/11427/24635. | en_ZA |
| dc.language.iso | eng | |
| dc.publisher.department | Department of Statistical Sciences | en_ZA |
| dc.publisher.faculty | Faculty of Science | en_ZA |
| dc.publisher.institution | University of Cape Town | |
| dc.source | ORION: Operations Research in South Africa | |
| dc.source.uri | http://orion.journals.ac.za/pub | |
| dc.subject.other | scheduling | |
| dc.subject.other | heuristic | |
| dc.subject.other | tardiness | |
| dc.title | A rescheduling heuristic for the single machine total tardiness problem | |
| dc.type | Journal Article | en_ZA |
| uct.type.filetype | Text | |
| uct.type.filetype | Image | |
| uct.type.publication | Research | en_ZA |
| uct.type.resource | Article | en_ZA |