Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/632
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mukherjee, Saral | |
dc.contributor.author | Chatterjee, A. K. | |
dc.date.accessioned | 2009-12-14T04:11:28Z | |
dc.date.available | 2009-12-14T04:11:28Z | |
dc.date.copyright | 2004-11 | |
dc.date.issued | 2009-12-14T04:11:28Z | |
dc.identifier.uri | http://hdl.handle.net/11718/632 | |
dc.language.iso | en | en |
dc.relation.ispartofseries | WP;1851 | |
dc.subject | Single Machine Scheduling | en |
dc.subject | Shifting Bottleneck Heuritic | en |
dc.subject | Machine-based Dicomposition | en |
dc.subject | Due Window | en |
dc.subject | Generalised Lateness Objective | en |
dc.title | On the representation of the one machine sequencing problem in the shifting bottleneck heuristic | en |
dc.type | Working Paper | en |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP 2004_1851.pdf | 738.05 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.