標題: D Minimizing Total Earliness and Tardiness for Common Due Date Single-Machine Scheduling with an Unavailability Interval
作者: Low, Chinyao
Li, Rong-Kwei
Wu, Guan-He
工業工程與管理學系
Department of Industrial Engineering and Management
公開日期: 1-Jan-2016
摘要: This paper addresses the problem of scheduling.. independent jobs on a single machine with a fixed unavailability interval, where the aim is to minimize the total earliness and tardiness (TET) about a common due date. Two exact methods are proposed for solving the problem: mixed integer linear programming formulations and a dynamic programming based method. These methods are coded and tested intensively on a large data set and the results are analytically compared. Computational experiments show that the dynamic programming method is efficient in obtaining the optimal solutions and no problems due to memory requirement.
URI: http://dx.doi.org/10.1155/2016/6124734
http://hdl.handle.net/11536/134043
ISSN: 1024-123X
DOI: 10.1155/2016/6124734
期刊: MATHEMATICAL PROBLEMS IN ENGINEERING
起始頁: 0
結束頁: 0
Appears in Collections:Articles


Files in This Item:

  1. 4dcc8defb319fa22161715f84f88f20c.pdf