Full metadata record
DC FieldValueLanguage
dc.contributor.authorChou, FDen_US
dc.contributor.authorLee, CEen_US
dc.date.accessioned2014-12-08T15:46:24Z-
dc.date.available2014-12-08T15:46:24Z-
dc.date.issued1999-07-01en_US
dc.identifier.issn0360-8352en_US
dc.identifier.urihttp://hdl.handle.net/11536/31226-
dc.description.abstractThis paper attempts to solve a two-machine flowshop bicriteria scheduling problem with release dates for the jobs, in which the objective function is to minimize a weighed sum of total flow time and makespan. To tackle this scheduling problem, an integer programming model with N-2 + 3N variables and 5N is the number of jobs, is formulated. Because of the lengthy computing time and high computing complexity of the integer programming model, a heuristic scheduling algorithm is presented. Experimental results show that the proposed heuristic algorithm can solve this problem rapidly and accurately. The average solution quality of the heuristic algorithm is above 99% and is much better than that of the SPT rule as a benchmark. A 15-job case requires only 0.018 s, on average to obtain an ultimate or even optimal solution. The heuristic scheduling algorithm is a more practical approach to real world applications than the integer programming model. (C) 1999 Published by Elsevier Science Ltd. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjecttwo-machine flowshopen_US
dc.subjectbicriteria schedulingen_US
dc.subjectflow timeen_US
dc.subjectmakespanen_US
dc.titleTwo-machine flowshop scheduling with bicriteria problemen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & INDUSTRIAL ENGINEERINGen_US
dc.citation.volume36en_US
dc.citation.issue3en_US
dc.citation.spage549en_US
dc.citation.epage564en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000083979300003-
dc.citation.woscount20-
Appears in Collections:Articles


Files in This Item:

  1. 000083979300003.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.