COMMON DUE-DATE DETERMINATION AND SEQUENCING USING TABU SEARCH

Authors
HAO Q YANG ZH WANG DW LUI Z
Citation
Q. Hao et al., COMMON DUE-DATE DETERMINATION AND SEQUENCING USING TABU SEARCH, Computers & operations research, 23(5), 1996, pp. 409-417
Citations number
24
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
23
Issue
5
Year of publication
1996
Pages
409 - 417
Database
ISI
SICI code
0305-0548(1996)23:5<409:CDDASU>2.0.ZU;2-I
Abstract
Tabu Search techniques are adapted to a single-machine scheduling prob lem where a common due-date for a set of jobs is determined. The probl em is to determine an optimal sequence sigma and the associated optim al due-date d which minimize the sum of weighted earliness and tardin ess values. This paper presents a Tabu Search based approach which is more efficient for solving larger problems than any existing solution method. (C) 1996 Elsevier Science Ltd