Scheduling time-dependent jobs under mixed deterioration

doi:10.1016/j.amc.2010.01.037

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Gawiejnowicz, Stanislaw	en_US
dc.contributor.author	Lin, Bertrand M. T.	en_US
dc.date.accessioned	2014-12-08T15:07:15Z	-
dc.date.available	2014-12-08T15:07:15Z	-
dc.date.issued	2010-03-15	en_US
dc.identifier.issn	0096-3003	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.amc.2010.01.037	en_US
dc.identifier.uri	http://hdl.handle.net/11536/5718	-
dc.description.abstract	We consider a new model of time-dependent scheduling. A set of deteriorating jobs has to be processed on a single machine which is available starting from a non-zero time. The processing times of some jobs from this set are constant, while other ones are either proportional or linear functions of the job starting times. The applied criteria of schedule optimality include the maximum completion time, the total completion time, the total weighted completion time, the maximum lateness and the number of tardy jobs. We delineate a sharp boundary between computationally easy and difficult problems, showing polynomially solvable and NP-hard cases. (C) 2010 Elsevier Inc. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	Scheduling	en_US
dc.subject	Single machine	en_US
dc.subject	Deteriorating jobs	en_US
dc.subject	Polynomial-time algorithms	en_US
dc.subject	NP-hard problems	en_US
dc.title	Scheduling time-dependent jobs under mixed deterioration	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.amc.2010.01.037	en_US
dc.identifier.journal	APPLIED MATHEMATICS AND COMPUTATION	en_US
dc.citation.volume	216	en_US
dc.citation.issue	2	en_US
dc.citation.spage	438	en_US
dc.citation.epage	447	en_US
dc.contributor.department	資訊管理與財務金融系註：原資管所+財金所	zh_TW
dc.contributor.department	Department of Information Management and Finance	en_US
dc.identifier.wosnumber	WOS:000275739000011	-
dc.citation.woscount	13	-
顯示於類別：	期刊論文

文件中的檔案：

000275739000011.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。