File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0377-2217(01)00302-2
- Scopus: eid_2-s2.0-0037120685
- WOS: WOS:000177456300007
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
Title | Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties |
---|---|
Authors | |
Keywords | Earliness And Tardiness Scheduling Single Machine Tabu Search |
Issue Date | 2002 |
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejor |
Citation | European Journal Of Operational Research, 2002, v. 142 n. 2, p. 271-281 How to Cite? |
Abstract | A single machine scheduling problem with distinct due windows to minimize total weighted earliness and tardiness is examined. A mathematical formulation of the problem is first presented and several important properties are studied to facilitate the solution process. An optimal timing algorithm is then proposed to determine completion times for each job in a given job sequence. A Tabu search (TS) procedure is employed together with the optimal timing algorithm to generate job sequences and final schedules. Computational experiments indicate that the performance of the proposed approach is quite well, especially for the instances of large size. © 2002 Elsevier Science B.V. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/178342 |
ISSN | 2023 Impact Factor: 6.0 2023 SCImago Journal Rankings: 2.321 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wan, G | en_US |
dc.contributor.author | Yen, BPC | en_US |
dc.date.accessioned | 2012-12-19T09:46:45Z | - |
dc.date.available | 2012-12-19T09:46:45Z | - |
dc.date.issued | 2002 | en_US |
dc.identifier.citation | European Journal Of Operational Research, 2002, v. 142 n. 2, p. 271-281 | en_US |
dc.identifier.issn | 0377-2217 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/178342 | - |
dc.description.abstract | A single machine scheduling problem with distinct due windows to minimize total weighted earliness and tardiness is examined. A mathematical formulation of the problem is first presented and several important properties are studied to facilitate the solution process. An optimal timing algorithm is then proposed to determine completion times for each job in a given job sequence. A Tabu search (TS) procedure is employed together with the optimal timing algorithm to generate job sequences and final schedules. Computational experiments indicate that the performance of the proposed approach is quite well, especially for the instances of large size. © 2002 Elsevier Science B.V. All rights reserved. | en_US |
dc.language | eng | en_US |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejor | en_US |
dc.relation.ispartof | European Journal of Operational Research | en_US |
dc.subject | Earliness And Tardiness | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Single Machine | en_US |
dc.subject | Tabu Search | en_US |
dc.title | Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties | en_US |
dc.type | Article | en_US |
dc.identifier.email | Yen, BPC: benyen@hkucc.hku.hk | en_US |
dc.identifier.authority | Yen, BPC=rp01121 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/S0377-2217(01)00302-2 | en_US |
dc.identifier.scopus | eid_2-s2.0-0037120685 | en_US |
dc.identifier.hkuros | 81363 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0037120685&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 142 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.spage | 271 | en_US |
dc.identifier.epage | 281 | en_US |
dc.identifier.isi | WOS:000177456300007 | - |
dc.publisher.place | Netherlands | en_US |
dc.identifier.scopusauthorid | Wan, G=7101629250 | en_US |
dc.identifier.scopusauthorid | Yen, BPC=7102564239 | en_US |
dc.customcontrol.immutable | csl 141205 | - |
dc.identifier.issnl | 0377-2217 | - |