Single-machine scheduling with supporting tasks

Simple item page
dc.citation.epage79en_US
dc.citation.spage69en_US
dc.citation.volume17en_US
dc.citation.woscount0en_US
dc.contributor.authorKononov, Alexander V.en_US
dc.contributor.authorLin, Bertrand M. T.en_US
dc.contributor.authorFang, Kuei-Tangen_US
dc.contributor.department資訊管理與財務金融系 註：原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.date.accessioned2015-12-02T02:59:17Z
dc.date.available2015-12-02T02:59:17Z
dc.date.issued2015-08-01en_US
dc.description.abstractThis paper investigates a single-machine scheduling problem with a set of supporting tasks and a set of jobs. Each job is preceded by a subset of supporting tasks, that is, the job cannot start its processing until all of its supporting tasks are finished. The objective functions are defined solely in job completion times. We discuss the complexities of several special cases for the number of late jobs and the total weighted completion time. This study adds new complexity results to the two standard objective functions under precedence constraints. (C) 2015 Elsevier B.V. All rights reserved.en_US
dc.identifier.doi10.1016/j.disopt.2015.05.001en_US
dc.identifier.issn1572-5286en_US
dc.identifier.journalDISCRETE OPTIMIZATIONen_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.disopt.2015.05.001en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/128000
dc.identifier.wosnumberWOS:000358630000005en_US
dc.language.isoen_USen_US
dc.subjectSingle-machine schedulingen_US
dc.subjectSupporting precedenceen_US
dc.subjectTotal weighted completion timeen_US
dc.subjectNumber of late jobsen_US
dc.titleSingle-machine scheduling with supporting tasksen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

期刊論文;;Articles