Minimizing the number of vehicles to meet a fixed periodic schedule : an application of periodic posets

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5379

Full metadata record

DC Field	Value	Language
dc.contributor	Orlin, James B., 1953-	-
dc.contributor	Massachusetts Institute of Technology. Operations Research Center	-
dc.date	2004-05-28T19:36:38Z	-
dc.date	2004-05-28T19:36:38Z	-
dc.date	1980	-
dc.date.accessioned	2013-10-09T02:39:25Z	-
dc.date.available	2013-10-09T02:39:25Z	-
dc.date.issued	2013-10-09	-
dc.identifier	102-80	-
dc.identifier	http://hdl.handle.net/1721.1/5379	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by James B. Orlin.	-
dc.description	Includes bibliographical references (leaf 25).	-
dc.description	Supported in part by the U.S. Army Research Office. DAAG29-80-C-0061	-
dc.format	25 leaves	-
dc.format	1319702 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 102-80.	-
dc.subject	Q175.M41 O616 no.102-, 80	-
dc.subject	Production scheduling	-
dc.subject	Network analysis (Planning)	-
dc.title	Minimizing the number of vehicles to meet a fixed periodic schedule : an application of periodic posets	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI