Algorithms for a class of single-machine weighted tardiness and earliness problems
dc.contributor.author | Yano, Candace Arai | en_US |
dc.contributor.author | Kim, Yeong-Dae | en_US |
dc.date.accessioned | 2006-04-10T14:43:07Z | |
dc.date.available | 2006-04-10T14:43:07Z | |
dc.date.issued | 1991-05-27 | en_US |
dc.identifier.citation | Yano, Candace Arai, Kim, Yeong-Dae (1991/05/27)."Algorithms for a class of single-machine weighted tardiness and earliness problems." European Journal of Operational Research 52(2): 167-178. <http://hdl.handle.net/2027.42/29324> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6VCT-48NBG0D-1PX/2/fa6631af65c0c917a6a702188a8cf904 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/29324 | |
dc.identifier.uri | http://www.ncbi.nlm.nih.gov/sites/entrez?cmd=retrieve&db=pubmed&list_uids=2061204&dopt=citation | en_US |
dc.description.abstract | We address the problem of determining schedules for static, single-machine scheduling problems where the objective is to minimize the sum of weighted tardiness and weighted earliness. We develop optimal and heuristic procedures for the special case of weights that are proportional to the processing times of the respective jobs. The optimal procedure uses dominance properties to reduce the number of sequences that must be considered, and some of the heuristic use these properties as a basis for constructing good initial sequences. A pairwise interchange procedure is used to improve the heuristic solutions. An experimental study shows that the heuristic procedures perform very well. | en_US |
dc.format.extent | 961340 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Algorithms for a class of single-machine weighted tardiness and earliness problems | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial & Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117, USA | en_US |
dc.contributor.affiliationother | Department of Industrial Engineering, Korean Advanced Institute of Science and Technology, Seoul, Korea | en_US |
dc.identifier.pmid | 2061204 | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/29324/1/0000389.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0377-2217(91)90078-A | en_US |
dc.identifier.source | European Journal of Operational Research | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.