Extensions of the traveling salesman problem: job sequencing with pattern constraints or due dates

Bibliographic Details
Main Author: Cash, Thomas Dalton
Published: Georgia Institute of Technology 2008
Subjects:
Online Access:http://hdl.handle.net/1853/25486
id ndltd-GATECH-oai-smartech.gatech.edu-1853-25486
record_format oai_dc
spelling ndltd-GATECH-oai-smartech.gatech.edu-1853-254862013-12-15T03:40:56ZExtensions of the traveling salesman problem: job sequencing with pattern constraints or due datesCash, Thomas DaltonProduction schedulingGeorgia Institute of Technology2008-11-10T15:12:03Z2008-11-10T15:12:03Z1968-12Thesishttp://hdl.handle.net/1853/25486252745Access restricted to authorized Georgia Tech users only.
collection NDLTD
sources NDLTD
topic Production scheduling
spellingShingle Production scheduling
Cash, Thomas Dalton
Extensions of the traveling salesman problem: job sequencing with pattern constraints or due dates
author Cash, Thomas Dalton
author_facet Cash, Thomas Dalton
author_sort Cash, Thomas Dalton
title Extensions of the traveling salesman problem: job sequencing with pattern constraints or due dates
title_short Extensions of the traveling salesman problem: job sequencing with pattern constraints or due dates
title_full Extensions of the traveling salesman problem: job sequencing with pattern constraints or due dates
title_fullStr Extensions of the traveling salesman problem: job sequencing with pattern constraints or due dates
title_full_unstemmed Extensions of the traveling salesman problem: job sequencing with pattern constraints or due dates
title_sort extensions of the traveling salesman problem: job sequencing with pattern constraints or due dates
publisher Georgia Institute of Technology
publishDate 2008
url http://hdl.handle.net/1853/25486
work_keys_str_mv AT cashthomasdalton extensionsofthetravelingsalesmanproblemjobsequencingwithpatternconstraintsorduedates
_version_ 1716619334702333952