File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.ejor.2008.01.029
- Scopus: eid_2-s2.0-55949106186
- WOS: WOS:000261825100007
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
| Title | Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs | ||||||
|---|---|---|---|---|---|---|---|
| Authors | |||||||
| Keywords | Dual criteria Earliness Number of tardy jobs Scheduling Single machine | ||||||
| Issue Date | 2009 | ||||||
| Publisher | Elsevier 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? | ||||||
| Abstract | Motivated 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 Identifier | http://hdl.handle.net/10722/60216 | ||||||
| ISSN | 2021 Impact Factor: 6.363 2020 SCImago Journal Rankings: 2.161 | ||||||
| ISI Accession Number ID |
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 Field | Value | Language |
|---|---|---|
| dc.contributor.author | Wan, G | en_HK |
| dc.contributor.author | Yen, BPC | en_HK |
| dc.date.accessioned | 2010-05-31T04:06:04Z | - |
| dc.date.available | 2010-05-31T04:06:04Z | - |
| dc.date.issued | 2009 | en_HK |
| dc.identifier.citation | European Journal Of Operational Research, 2009, v. 195 n. 1, p. 89-97 | en_HK |
| dc.identifier.issn | 0377-2217 | en_HK |
| dc.identifier.uri | http://hdl.handle.net/10722/60216 | - |
| dc.description.abstract | Motivated 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.language | eng | en_HK |
| dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejor | en_HK |
| dc.relation.ispartof | European Journal of Operational Research | en_HK |
| dc.subject | Dual criteria | en_HK |
| dc.subject | Earliness | en_HK |
| dc.subject | Number of tardy jobs | en_HK |
| dc.subject | Scheduling | en_HK |
| dc.subject | Single machine | en_HK |
| dc.title | Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs | en_HK |
| dc.type | Article | en_HK |
| dc.identifier.openurl | http://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+tardy | en_HK |
| dc.identifier.email | Yen, BPC: benyen@hkucc.hku.hk | en_HK |
| dc.identifier.authority | Yen, BPC=rp01121 | en_HK |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1016/j.ejor.2008.01.029 | en_HK |
| dc.identifier.scopus | eid_2-s2.0-55949106186 | en_HK |
| dc.identifier.hkuros | 162830 | en_HK |
| dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-55949106186&selection=ref&src=s&origin=recordpage | en_HK |
| dc.identifier.volume | 195 | en_HK |
| dc.identifier.issue | 1 | en_HK |
| dc.identifier.spage | 89 | en_HK |
| dc.identifier.epage | 97 | en_HK |
| dc.identifier.isi | WOS:000261825100007 | - |
| dc.publisher.place | Netherlands | en_HK |
| dc.identifier.scopusauthorid | Wan, G=7101629250 | en_HK |
| dc.identifier.scopusauthorid | Yen, BPC=7102564239 | en_HK |
| dc.identifier.issnl | 0377-2217 | - |