Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/632
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMukherjee, Saral
dc.contributor.authorChatterjee, A. K.
dc.date.accessioned2009-12-14T04:11:28Z
dc.date.available2009-12-14T04:11:28Z
dc.date.copyright2004-11
dc.date.issued2009-12-14T04:11:28Z
dc.identifier.urihttp://hdl.handle.net/11718/632
dc.language.isoenen
dc.relation.ispartofseriesWP;1851
dc.subjectSingle Machine Schedulingen
dc.subjectShifting Bottleneck Heuriticen
dc.subjectMachine-based Dicompositionen
dc.subjectDue Windowen
dc.subjectGeneralised Lateness Objectiveen
dc.titleOn the representation of the one machine sequencing problem in the shifting bottleneck heuristicen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 2004_1851.pdf738.05 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.