Full metadata record
DC FieldValueLanguage
dc.contributor.authorWu, HHen_US
dc.contributor.authorLi, RKen_US
dc.date.accessioned2014-12-08T15:02:31Z-
dc.date.available2014-12-08T15:02:31Z-
dc.date.issued1996-07-01en_US
dc.identifier.issn0953-7287en_US
dc.identifier.urihttp://hdl.handle.net/11536/1178-
dc.description.abstractA generated schedule can be improved (especially on due date performance) simply by compressing the current schedule to the left. Additionally, two forms of schedule compression are available, i.e. simple compression and complex compression. In practical considerations, however, knowing exactly where the compression effort should be placed so that the schedule can be improved more efficiently is a relatively difficult task. This decision requires an evaluation methodology, which is the primary objective of this study. The evaluation methodology is based on the priority weight computation for those affected operations. The priority weight computation is an integration of sequence effect weight with time effect weight. The priority weight information provides not only where the compression effort should be placed but also the intelligent information of (1) the operations related to the compression effort and (2) the time that job(s) can be packed to the left. Specifics of the schedule compression concepts and algorithms of the evaluation methodology are also discussed.en_US
dc.language.isoen_USen_US
dc.subjectscheduleen_US
dc.subjectschedule graphen_US
dc.subjectschedule compressionen_US
dc.subjectLeitstanden_US
dc.titleA methodology for schedule compressionen_US
dc.typeArticleen_US
dc.identifier.journalPRODUCTION PLANNING & CONTROLen_US
dc.citation.volume7en_US
dc.citation.issue4en_US
dc.citation.spage407en_US
dc.citation.epage417en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
Appears in Collections:Articles