Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs

None

Guardado en:
Detalles Bibliográficos
Autores principales: Huang, H.L., Lin, B.M.T.
Formato: Capítulo de libro
Lenguaje:inglés
Publicado: IntechOpen 2007
Materias:
Acceso en línea:https://www.intechopen.com/chapters/621
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1879225214053646336
author Huang, H.L.
Lin, B.M.T.
author_browse Huang, H.L.
Lin, B.M.T.
author_facet Huang, H.L.
Lin, B.M.T.
author_sort Huang, H.L.
building IntechOpen
collection Acceso abierto
description None
doi_str_mv 10.5772/5223
first_indexed 2026-10-16T13:40:20Z
format Book Chapter
fullrecord <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><identifier>intech-621</identifier><datestamp>2007-12-01</datestamp> <dc:title>Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs</dc:title> <dc:creator>H.L. Huang</dc:creator> <dc:creator>B.M.T. Lin</dc:creator> <dc:subject>Physical Sciences, Engineering and Technology</dc:subject> <dc:description>None</dc:description> <dc:publisher>IntechOpen</dc:publisher> <dc:date>2007-12-01</dc:date> <dc:type>Chapter, Part Of Book</dc:type> <dc:identifier>https://www.intechopen.com/chapters/621</dc:identifier> <dc:identifier>doi:10.5772/5223</dc:identifier> <dc:language>en</dc:language> <dc:relation>ISBN:978-3-902613-02-8</dc:relation> <dc:rights>https://creativecommons.org/licenses/by-nc-sa/3.0/</dc:rights> <dc:source>https://www.intechopen.com/books/3596 ; Multiprocessor Scheduling, Theory and Applications</dc:source> </oai_dc:dc>
id intech-621
institution IntechOpen
isbn 978-3-902613-02-8
language English
last_indexed 2026-10-16T13:40:20Z
publishDate 2007
publishDateRange 2007
publishDateSort 2007
publisher IntechOpen
publisherStr IntechOpen
record_format oai_dc
spelling intech-6212007-12-01 Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs H.L. Huang B.M.T. Lin Physical Sciences, Engineering and Technology None IntechOpen 2007-12-01 Chapter, Part Of Book https://www.intechopen.com/chapters/621 doi:10.5772/5223 en ISBN:978-3-902613-02-8 https://creativecommons.org/licenses/by-nc-sa/3.0/ https://www.intechopen.com/books/3596 ; Multiprocessor Scheduling, Theory and Applications
spellingShingle Physical Sciences, Engineering and Technology
Huang, H.L.
Lin, B.M.T.
Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs
title Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs
title_full Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs
title_fullStr Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs
title_full_unstemmed Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs
title_short Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs
title_sort concurrent openshop problem to minimize the weighted number of late jobs
topic Physical Sciences, Engineering and Technology
url https://www.intechopen.com/chapters/621
work_keys_str_mv AT huanghl concurrentopenshopproblemtominimizetheweightednumberoflatejobs
AT linbmt concurrentopenshopproblemtominimizetheweightednumberoflatejobs