DOI
stands for Digital Object Identifier
(
D
igital
O
bject
I
dentifier
)
,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.
Using DOI as a persistent link
To create a persistent link, add「http://dx.doi.org/」
「
http://dx.doi.org/
」
before a DOI.
For instance, if the DOI of an article is
10.5297/ser.1201.002
, you can link persistently to the article by entering the following link in your browser:
http://dx.doi.org/
10.5297/ser.1201.002
。
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.
Cite a document with DOI
When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.
DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI Registration ( doi.airiti.com ) 。
在機台可利用時間與機台合適度限制下工作可佔先之開放型排程問題
Preemptive open-shop scheduling with machine availability and eligibility constraints
彭莞筑 , Masters Advisor:蘇玲慧
繁體中文
DOI:
10.6840/CYCU.2010.00425
機台可利用時間 ; 機台合適度 ; 開放型排程 ; 排程 ; 佔先 ; CSP ; Availability constraint ; CSP ; Eligibility constraint ; Open-shop ; Scheduling ; Preemptive


- [1] T. Gonalez, S. Sahni (1976), “Open shop scheduling to minimize finish time,” Journal of the Association for Computing Machinery 23, pp. 665-679.
連結: - [2] S.V. Sevastianov, G..J. Woeginer (1998), “Makespan minimization in open shops- A polynomial time approximation scheme,” Mathematical Programming 82, pp. 191-198.
連結: - [3] C.F. Liaw, C.Y. Cheng, M. Chen (2002), “The total completion time open shop scheduling problem with a given sequence of jobs on one machine,” Computer & Operations Research 29, pp. 1251-1266.
連結: - [4] C.F. Liaw (2004), “Scheduling two-machine preemptive open shop to minimize total completion time,” Computers & Operations Research 31, pp. 1349-1363.
連結: - [5] C.F. Liaw (2005), “Scheduling preemptive open shops to minimize total tardiness,” European Journal of Operational Research 162, pp. 173-183.
連結: