Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||A heuristic for single machine scheduling with early and tardy costs|
|Abstract:||The problem of scheduling jobs with distinct ready times and due dates in a single machine to minimise the total earliness and tardiness penalties is considered. A constructive heuristic, which determines the sequence of jobs and simultaneously inserts idle times, is proposed. Adjacent pairwise interchange is then applied to the schedule obtained. For problems involving at most 12 jobs the heuristic solutions are compared to optimal solutions. For larger problems with up to 80 jobs the heuristic is tested against a local search based on pairwise interchanges and four dispatching rules presented in the literature. In each case, idle times are optimally inserted. (C) 2001 Elsevier Science B.V. All rights reserved.|
|Editor:||Elsevier Science Bv|
|Citation:||European Journal Of Operational Research. Elsevier Science Bv, v. 128, n. 1, n. 129, n. 146, 2001.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.