Tabu-search for the multi-mode job-shop problem

DC FieldValueLanguage
dc.contributor.authorBrucker, P
dc.contributor.authorNeyer, J
dc.date.accessioned2021-12-23T15:58:30Z-
dc.date.available2021-12-23T15:58:30Z-
dc.date.issued1998
dc.identifier.issn01716468
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/3408-
dc.description.abstractIn a multi-processor-tasks job-shop problem (MPTJSP) there is a machine set associated with each operation. All machines are needed for the whole processing period to process the operation. The objective is to find a schedule which minimizes the makespan. In a multi-mode job-shop problem (MMJSP) there is a set of machine sets associated with each operation. One has to assign a machine set to each operation and to solve the resulting MPTJSP such that the resulting makespan is minimized. For the MMJSP a tabu-search algorithm is presented. Computational results are reported.
dc.language.isoen
dc.publisherSPRINGER VERLAG
dc.relation.ispartofOR SPEKTRUM
dc.subjectmulti-mode job-shop
dc.subjectmulti-purpose-machine job-shop
dc.subjectmultiprocessor-task job-shop
dc.subjectMULTIPURPOSE MACHINES
dc.subjectOperations Research & Management Science
dc.subjecttabu-search
dc.titleTabu-search for the multi-mode job-shop problem
dc.typejournal article
dc.identifier.isiISI:000072064700004
dc.description.volume20
dc.description.issue1
dc.description.startpage21
dc.description.endpage28
dc.publisher.place175 FIFTH AVE, NEW YORK, NY 10010 USA
dcterms.isPartOf.abbreviationOR Spektrum
Show simple item record

Page view(s)

1
Last Week
0
Last month
0
checked on Apr 14, 2024

Google ScholarTM

Check