Vis enkel innførsel

dc.contributor.authorDauzère-Pérès, Stéphane
dc.contributor.authorDing, Junwen
dc.contributor.authorShen, Liji
dc.contributor.authorTamssaouet, Karim
dc.date.accessioned2024-07-29T13:52:40Z
dc.date.available2024-07-29T13:52:40Z
dc.date.created2023-05-31T11:23:00Z
dc.date.issued2023
dc.identifier.citationEuropean Journal of Operational Research. 2023, .en_US
dc.identifier.issn0377-2217
dc.identifier.urihttps://hdl.handle.net/11250/3143598
dc.description.abstractThe flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which has wide applications in the real world. The complexity and relevance of the FJSP have led to numerous research works on its modeling and resolution. This paper reviews some of the research of the past 30 years on the problem, by presenting and classifying the different criteria, constraints, configurations and solution approaches that have been considered. Recent emerging topics on complex shop scheduling, multi-criteria optimization and uncertain and dynamic environments are discussed. Finally, future research opportunities are proposed.en_US
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.subjectSchedulingen_US
dc.subjectFlexible job shopen_US
dc.subjectSurveyen_US
dc.subjectCriteriaen_US
dc.subjectConstraintsen_US
dc.titleThe flexible job shop scheduling problem: A reviewen_US
dc.title.alternativeThe flexible job shop scheduling problem: A reviewen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionpublishedVersionen_US
dc.rights.holderThe Authorsen_US
dc.source.pagenumber24en_US
dc.source.volume314en_US
dc.source.journalEuropean Journal of Operational Researchen_US
dc.source.issue2en_US
dc.identifier.doi10.1016/j.ejor.2023.05.017
dc.identifier.cristin2150388
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.fulltextpostprint
cristin.qualitycode2


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel

Navngivelse 4.0 Internasjonal
Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal