Show simple item record

dc.contributorHall, Leslie A.en_US
dc.contributorMassachusetts Institute of Technology. Operations Research Centeren_US
dc.date.accessioned2004-05-28T19:36:12Z
dc.date.available2004-05-28T19:36:12Z
dc.date.issued1989en_US
dc.identifier.otherOR 199-89en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5371
dc.descriptionIncludes bibliographical references (leaves 21-22).en_US
dc.description.statementofresponsibilityby Leslie A. Hall and David B. Shmoys.en_US
dc.format.extent22 leavesen_US
dc.format.extent1571507 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesWorking paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 199-89.en_US
dc.subject.lccQ175.M41 O616 no.199-89en_US
dc.titleJackson's rule for one-machine scheduling : making a good heuristic betteren_US
dc.typeWorking Paper
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record