Full metadata record
DC FieldValueLanguage
dc.contributor.authorLow, Chinyaoen_US
dc.contributor.authorLi, Rong-Kweien_US
dc.contributor.authorWu, Guan-Heen_US
dc.date.accessioned2019-04-03T06:40:15Z-
dc.date.available2019-04-03T06:40:15Z-
dc.date.issued2016-01-01en_US
dc.identifier.issn1024-123Xen_US
dc.identifier.urihttp://dx.doi.org/10.1155/2016/6124734en_US
dc.identifier.urihttp://hdl.handle.net/11536/134043-
dc.description.abstractThis 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.en_US
dc.language.isoen_USen_US
dc.titleD Minimizing Total Earliness and Tardiness for Common Due Date Single-Machine Scheduling with an Unavailability Intervalen_US
dc.typeArticleen_US
dc.identifier.doi10.1155/2016/6124734en_US
dc.identifier.journalMATHEMATICAL PROBLEMS IN ENGINEERINGen_US
dc.citation.spage0en_US
dc.citation.epage0en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000380676600001en_US
dc.citation.woscount0en_US
Appears in Collections:Articles


Files in This Item:

  1. 4dcc8defb319fa22161715f84f88f20c.pdf