Show simple item record

dc.contributor.authorAnh, Dinh Le The
dc.date.accessioned2018-02-13T08:48:19Z
dc.date.accessioned2018-05-16T04:06:13Z
dc.date.available2018-02-13T08:48:19Z
dc.date.available2018-05-16T04:06:13Z
dc.date.issued2015
dc.identifier.other022002515
dc.identifier.urihttp://10.8.20.7:8080/xmlui/handle/123456789/2251
dc.description.abstractThis paper describes the job shop scheduling of a wood factory under machine breakdowns. In this research, the multiple objective optimization was applied to Job shop Scheduling under machine breakdowns problem. Traditionally, there were some objectives including Minimize Makespan, Minimize Mean Flowtime, Minimize total tardiness, Minimize number of Tardy Jobs. These objectives, however, are not enough for facing with the real problems when the manager wants more than one goal. The problem was formulated as a Linear Programming Problem (LPP ). A Compromise Programming (CP) approach was used to solve the multi-objectives problem, to have the best compromise scheduling among the mentioned objectives. The program would help the company increase the performance of the work shop, then increase profits. Keywords: Multiple Objective Optimization, Job shop Scheduling Problem, Linear Programming Problem, Compromise Programming.en_US
dc.description.sponsorshipAssoc. Prof. Ho Thanh Phongen_US
dc.language.isoen_USen_US
dc.publisherInternational University - HCMCen_US
dc.subjectExecutive management; Multi-objective optimalen_US
dc.titleMulti-objective optimal job shop scheduling under machine breakdownsen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record