Sequencing Problems in Periodic Job Shops: an MIP, Decomposition, and Complexity

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 305
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, Tae-Eog-
dc.date.accessioned2013-03-14T23:10:12Z-
dc.date.available2013-03-14T23:10:12Z-
dc.date.created2012-02-06-
dc.date.issued1992-04-
dc.identifier.citation한국경영과학회/대한산업공학회 춘계공동학술대회 , v., no., pp.558 - 558-
dc.identifier.urihttp://hdl.handle.net/10203/114385-
dc.languageKOR-
dc.publisher한국경영과학회/대한산업공학회-
dc.titleSequencing Problems in Periodic Job Shops: an MIP, Decomposition, and Complexity-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage558-
dc.citation.endingpage558-
dc.citation.publicationname한국경영과학회/대한산업공학회 춘계공동학술대회-
dc.identifier.conferencecountrySouth Korea-
dc.identifier.conferencecountrySouth Korea-
dc.contributor.localauthorLee, Tae-Eog-
Appears in Collection
IE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0