Parallel machine scheduling with multiple processing alternatives and sequence-dependent setup times

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 67
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKim, Junko
dc.contributor.authorKim, Hyun-Jungko
dc.date.accessioned2021-09-24T05:11:09Z-
dc.date.available2021-09-24T05:11:09Z-
dc.date.created2020-07-27-
dc.date.issued2021-09-
dc.identifier.citationINTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.59, no.18, pp.5438 - 5453-
dc.identifier.issn0020-7543-
dc.identifier.urihttp://hdl.handle.net/10203/287829-
dc.description.abstractThis paper examines a parallel machine scheduling problem in which jobs can be processed either in multiple parts or in a complete form and the number of possible job splitting alternatives of jobs is more than one. There are sequence-dependent setup times between different jobs (or parts), and the objective is to minimise makespan by choosing an appropriate processing alternative for each job, assigning parts (or jobs) to machines, and determining the sequence of parts on the machines. This work is motivated from a 3D printer-based manufacturing system that produces customised products for individuals or start-up companies. When 3D printers are used as processing machines, a product can be printed in diverse forms composed of different parts. To address the problem, we first propose a mixed integer programming model and then develop a hybrid genetic algorithm which is combined with a travelling salesman problem-based heuristic algorithm. The experimental results show that the average gap between a solution from the proposed algorithm and an optimal one solved with CPLEX or a lower bound is very small. The paired t-test shows that there is a significant improvement for processing jobs with multiple alternatives.-
dc.languageEnglish-
dc.publisherTAYLOR & FRANCIS LTD-
dc.titleParallel machine scheduling with multiple processing alternatives and sequence-dependent setup times-
dc.typeArticle-
dc.identifier.wosid000548120000001-
dc.identifier.scopusid2-s2.0-85087448157-
dc.type.rimsART-
dc.citation.volume59-
dc.citation.issue18-
dc.citation.beginningpage5438-
dc.citation.endingpage5453-
dc.citation.publicationnameINTERNATIONAL JOURNAL OF PRODUCTION RESEARCH-
dc.identifier.doi10.1080/00207543.2020.1781278-
dc.contributor.localauthorKim, Hyun-Jung-
dc.contributor.nonIdAuthorKim, Jun-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthor3D printing scheduling-
dc.subject.keywordAuthorminimisation of makespan-
dc.subject.keywordAuthormathematical programming model-
dc.subject.keywordAuthorsequence-dependent setup time-
dc.subject.keywordAuthorhybrid genetic algorithm-
dc.subject.keywordPlusPARTICLE SWARM OPTIMIZATION-
dc.subject.keywordPlusGENETIC ALGORITHM-
dc.subject.keywordPlusLOCAL SEARCH-
dc.subject.keywordPlusTABU SEARCH-
dc.subject.keywordPlusJOBS-
dc.subject.keywordPlusMAKESPAN-
dc.subject.keywordPlusMINIMIZE-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0