Show simple item record

dc.contributor.authorTamssaouet, Karim
dc.contributor.authorDauzère-Pérès, Stéphane
dc.date.accessioned2023-08-29T10:33:46Z
dc.date.available2023-08-29T10:33:46Z
dc.date.created2023-05-15T21:27:16Z
dc.date.issued2023
dc.identifier.citationEuropean Journal of Operational Research. 2023, 311 (2), 455-471.en_US
dc.identifier.issn0377-2217
dc.identifier.urihttps://hdl.handle.net/11250/3086160
dc.description.abstractThis article introduces a framework that unifies and generalizes well-known literature results related to local search for the job-shop and flexible job-shop scheduling problems. In addition to the choice of the metaheuristic and the neighborhood structure, the success of most of the influential local search approaches relies on the ability to quickly and efficiently rule out infeasible moves and evaluate the quality of the feasible neighbors. Hence, the proposed framework focuses on the feasibility and quality evaluation of a general move when solving the job-shop and flexible job-shop scheduling problems for any regular objective function. The proposed framework is valid for any scheduling problem where the defined neighborhood structure is appropriate, and each solution to the problem can be modeled with a directed acyclic graph with {non-negative weights on nodes and arcs}. The feasibility conditions and quality estimation procedures proposed in the literature rely heavily on information on the existence of a path between two nodes. Thus, based on an original parameterized algorithm that asserts the existence of a path between two nodes, novel generic procedures to evaluate the feasibility of a move and estimate the value of any regular objective function of a neighbor solution are proposed. We show that many well-known literature results are special cases of our results, which can be applied to a wide range of shop scheduling problems.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.subjectJob-shop schedulingen_US
dc.subjectFlexible job-shop schedulingen_US
dc.subjectHeuristicsen_US
dc.titleA general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problemsen_US
dc.title.alternativeA general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problemsen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionpublishedVersionen_US
dc.rights.holderThe Authorsen_US
dc.source.pagenumber455-471en_US
dc.source.volume311en_US
dc.source.journalEuropean Journal of Operational Researchen_US
dc.source.issue2en_US
dc.identifier.doi10.1016/j.ejor.2023.05.018
dc.identifier.cristin2147694
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.fulltextpostprint
cristin.qualitycode2


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Navngivelse 4.0 Internasjonal
Except where otherwise noted, this item's license is described as Navngivelse 4.0 Internasjonal