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
「
https://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:
https://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 a document with a DOI, the DOI permanent URL should always be presented (if using APA or Chicago format, present https://doi.org/DOI number). If using a citation format that does not specify DOI, the DOI permanent URL should still be presented as a priority.
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 ) 。
Flexible preventive maintenance planning for two parallel machines problem to minimize makespan
蔡曉玲 , Masters Advisor:蘇玲慧
繁體中文
DOI:
10.6840/cycu200700497
彈性維修 ; 平行機台 ; 最大完工時間 ; Parallel Machine ; Flexibly Maintenance ; Makespan


- [1]C.Y. Lee, Machine scheduling with an availability constraint, Journal of Global Optimization 9 (1996) 395–416.
連結: - [2]C.Y. Lee, S.D. Liman, Capacitated two-parallel machines scheduling to minimize sum of job completion times, Discrete Applied Mathematics 41 (1993) 211–222.
連結: - [3]C.Y. Lee, Z.L. Chen, Scheduling jobs and maintenance activities on parallel machines, Naval Research Logistics 47 (2000) 145–165.
連結: - [4]Garey, M.R. and Johnson, D.S., 1979, Computers and intractability:A guide to the theory of NP-completeness, Freeman, San Francisco.
連結: - [5]G. Mosheiov, Minimizing the sum of job completion times on capacitated parallel machines, Math Comput Model 20 (1994), 91-99.
連結: