File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs

TitleSingle machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
Authors
KeywordsDual criteria
Earliness
Number of tardy jobs
Scheduling
Single machine
Issue Date2009
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejor
Citation
European Journal Of Operational Research, 2009, v. 195 n. 1, p. 89-97 How to Cite?
AbstractMotivated by just-in-time manufacturing, we consider a single machine scheduling problem with dual criteria, i.e., the minimization of the total weighted earliness subject to minimum number of tardy jobs. We discuss several dominance properties of optimal solutions. We then develop a heuristic algorithm with time complexity O(n3) and a branch and bound algorithm to solve the problem. The computational experiments show that the heuristic algorithm is effective in terms of solution quality in many instances while the branch and bound algorithm is efficient for medium-size problems. © 2008 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/60216
ISSN
2015 Impact Factor: 2.679
2015 SCImago Journal Rankings: 2.595
ISI Accession Number ID
Funding AgencyGrant Number
NSF of China70372058
Guangdong NSF031808
Funding Information:

The authors thank two anonymous referees for their constructive comments, which help to improve presentation of the paper substantially. This research is supported in part by NSF of China (70372058) and Guangdong NSF (031808).

References

 

DC FieldValueLanguage
dc.contributor.authorWan, Gen_HK
dc.contributor.authorYen, BPCen_HK
dc.date.accessioned2010-05-31T04:06:04Z-
dc.date.available2010-05-31T04:06:04Z-
dc.date.issued2009en_HK
dc.identifier.citationEuropean Journal Of Operational Research, 2009, v. 195 n. 1, p. 89-97en_HK
dc.identifier.issn0377-2217en_HK
dc.identifier.urihttp://hdl.handle.net/10722/60216-
dc.description.abstractMotivated by just-in-time manufacturing, we consider a single machine scheduling problem with dual criteria, i.e., the minimization of the total weighted earliness subject to minimum number of tardy jobs. We discuss several dominance properties of optimal solutions. We then develop a heuristic algorithm with time complexity O(n3) and a branch and bound algorithm to solve the problem. The computational experiments show that the heuristic algorithm is effective in terms of solution quality in many instances while the branch and bound algorithm is efficient for medium-size problems. © 2008 Elsevier B.V. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejoren_HK
dc.relation.ispartofEuropean Journal of Operational Researchen_HK
dc.subjectDual criteriaen_HK
dc.subjectEarlinessen_HK
dc.subjectNumber of tardy jobsen_HK
dc.subjectSchedulingen_HK
dc.subjectSingle machineen_HK
dc.titleSingle machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0377-2217&volume=195&spage=89&epage=97&date=2009&atitle=Single+machine+scheduling+to+minimize+total+weighted+earliness+subject+to+minimum+number+tardyen_HK
dc.identifier.emailYen, BPC: benyen@hkucc.hku.hken_HK
dc.identifier.authorityYen, BPC=rp01121en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.ejor.2008.01.029en_HK
dc.identifier.scopuseid_2-s2.0-55949106186en_HK
dc.identifier.hkuros162830en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-55949106186&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume195en_HK
dc.identifier.issue1en_HK
dc.identifier.spage89en_HK
dc.identifier.epage97en_HK
dc.identifier.isiWOS:000261825100007-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridWan, G=7101629250en_HK
dc.identifier.scopusauthoridYen, BPC=7102564239en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats