File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

TitleTabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
Authors
KeywordsEarliness And Tardiness
Scheduling
Single Machine
Tabu Search
Issue Date2002
PublisherElsevier 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?
AbstractA 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 Identifierhttp://hdl.handle.net/10722/178342
ISSN
2015 Impact Factor: 2.679
2015 SCImago Journal Rankings: 2.595
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorWan, Gen_US
dc.contributor.authorYen, BPCen_US
dc.date.accessioned2012-12-19T09:46:45Z-
dc.date.available2012-12-19T09:46:45Z-
dc.date.issued2002en_US
dc.identifier.citationEuropean Journal Of Operational Research, 2002, v. 142 n. 2, p. 271-281en_US
dc.identifier.issn0377-2217en_US
dc.identifier.urihttp://hdl.handle.net/10722/178342-
dc.description.abstractA 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.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejoren_US
dc.relation.ispartofEuropean Journal of Operational Researchen_US
dc.subjectEarliness And Tardinessen_US
dc.subjectSchedulingen_US
dc.subjectSingle Machineen_US
dc.subjectTabu Searchen_US
dc.titleTabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penaltiesen_US
dc.typeArticleen_US
dc.identifier.emailYen, BPC: benyen@hkucc.hku.hken_US
dc.identifier.authorityYen, BPC=rp01121en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/S0377-2217(01)00302-2en_US
dc.identifier.scopuseid_2-s2.0-0037120685en_US
dc.identifier.hkuros81363-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0037120685&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume142en_US
dc.identifier.issue2en_US
dc.identifier.spage271en_US
dc.identifier.epage281en_US
dc.identifier.isiWOS:000177456300007-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridWan, G=7101629250en_US
dc.identifier.scopusauthoridYen, BPC=7102564239en_US
dc.customcontrol.immutablecsl 141205-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats