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 ) 。
馮聖哲 , Masters Advisor:蘇玲慧
繁體中文
DOI:
10.6840/CYCU.2010.00447
排程 ; 等效平行機台 ; TADC ; 最大完工時間 ; Scheduling ; Identical parallel machine ; TADC ; Makespan


- Chen, W.Y., Sheen, G.J.,2007. Single-machine scheduling with multiple performance measures: Minimizing job-dependent earliness and tardiness subject to the number of tardy jobs. International Journal of Production Economics 109, 214-229
連結: - Framina, J.M., Leiste, R.,2006. A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness.International Journal of Production Economics 99, 28-40
連結: - Ganesan, V.K., Sivakumar, A.I., 2006. Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times. International Journal of Production Economics 103, 633-647
連結: - Gowrishankar, K., Rajendran, C., Srinivasan, G.,2001. Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date. European Journal of Operational Research 132, 643-665
連結: - Ganesan, V.K., Sivakumar, A.I., Srinivasan, G.,2006. Hierarchical minimization of completion time variance and makespan in jobshops. Computers & Operations Research 33, 1345-1367
連結: