DSpace at KOASAS
College of Engineering(공과대학)Dept. of Industrial and Systems Engineering(산업및시스템공학과)IE-Journal Papers(저널논문)

HEURISTICS FOR FLOWSHOP SCHEDULING PROBLEMS MINIMIZING MEAN TARDINESS

Cited 95 time in webofscience Cited 0 time in scopus
  • Hit : 954
  • Download : 37
Export
DC FieldValueLanguage
dc.contributor.authorKim, Yeong-Daeko
dc.date.accessioned2008-10-09T12:44:36Z-
dc.date.available2008-10-09T12:44:36Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1993-01-
dc.identifier.citationJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.44, no.1, pp.19 - 28-
dc.identifier.issn0160-5682-
dc.identifier.urihttp://hdl.handle.net/10203/7608-
dc.description.abstractSeveral heuristics are presented for the flowshop scheduling problem with the objective of minimizing mean tardiness. We consider the cases in which job sequences on all machines are the same (permutation flowshop) and in which they may be different. For the former case, the various methods that have been devised for minimizing the makespan are modified for our objective, while the list scheduling algorithm is used for the latter case. These heuristics are tested and compared with each other on randomly-generated test problems.-
dc.languageEnglish-
dc.language.isoen_USen
dc.publisherSTOCKTON PRESS-
dc.subjectSHOP SEQUENCING PROBLEM-
dc.subjectJOB-SHOP-
dc.subjectDISPATCHING RULES-
dc.subjectM-MACHINE-
dc.subjectN-JOB-
dc.subjectALGORITHM-
dc.subjectAPPROXIMATION-
dc.titleHEURISTICS FOR FLOWSHOP SCHEDULING PROBLEMS MINIMIZING MEAN TARDINESS-
dc.typeArticle-
dc.identifier.wosidA1993KG63500003-
dc.identifier.scopusid2-s2.0-0027240799-
dc.type.rimsART-
dc.citation.volume44-
dc.citation.issue1-
dc.citation.beginningpage19-
dc.citation.endingpage28-
dc.citation.publicationnameJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorKim, Yeong-Dae-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorHEURISTICS-
dc.subject.keywordAuthorSCHEDULING-
dc.subject.keywordAuthorSEQUENCING-
dc.subject.keywordPlusSHOP SEQUENCING PROBLEM-
dc.subject.keywordPlusJOB-SHOP-
dc.subject.keywordPlusDISPATCHING RULES-
dc.subject.keywordPlusM-MACHINE-
dc.subject.keywordPlusN-JOB-
dc.subject.keywordPlusALGORITHM-
dc.subject.keywordPlusAPPROXIMATION-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 95 items in WoS Click to see citing articles in records_button

Display Simple Item Record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


rss_1.0 rss_2.0 atom_1.0