透過您的圖書館登入
IP:18.119.17.64
  • 期刊

Single-Machine Scheduling with Due-Date Assignment and Aging Effect under a DeterioratingMaintenance Activity Consideration

並列摘要


This study investigates single-machine due-date assignment and scheduling problems with a job-dependent aging effect under a deteriorating maintenance activity consideration simul-taneously. The maintenance activity can be scheduled immediately after any one of the jobs has been completed. In order to model the problem more realistic, we assume that: (1) once the maintenance activity has been completed, the machine will revert to its initial condition and the aging effect will start anew, and (2) the machine maintenance duration depends on its starting time. The objective is to find the optimal maintenance position as well as the optimal location of the common due-date for minimizing the total of earliness, tardiness and due-date costs. We introduce a polynomial O(n^4) time solution for the problem. We also present two special cases of the problem and show that they can be optimally solved by a lower order algorithm.

參考文獻


Baker, K. R.,Scudder, G. D.(1990).Sequencing with earliness and tardiness penalties: A review.Operations Research.28,22-35.
Biskup, D.(1999).Single-machine scheduling with learning considerations.European Journal of Operational Research.115,173-178.
Biskup, D.(2008).A state-of-the-art review on scheduling with learning effects.European Journal of Operational Research.188,315-329.
Brucker, P.(2001).Scheduling Algorithms.New York:Springer.
Chang, P.-C.,Chen, S.-H.,Mani, V.(2009).A note on due-date assignment and single machine scheduling with a learning/aging effect.International Journal of Production Economics.117,142-149.

被引用紀錄


江禮安(2015)。傳送端於非完美通道資訊下之細胞間干擾處理〔碩士論文,國立臺灣大學〕。華藝線上圖書館。https://doi.org/10.6342/NTU.2015.01798

延伸閱讀