{"id":236,"date":"2018-10-23T07:59:24","date_gmt":"2018-10-23T07:59:24","guid":{"rendered":"http:\/\/www.cs.ubbcluj.ro\/~meco\/?p=236"},"modified":"2026-02-01T12:09:25","modified_gmt":"2026-02-01T12:09:25","slug":"a-four-phase-meta-heuristic-algorithm-for-solving-large-scale-instances-of-the-shift-minimization-personnel-task-scheduling-problem-2017","status":"publish","type":"post","link":"https:\/\/www.cs.ubbcluj.ro\/~meco\/a-four-phase-meta-heuristic-algorithm-for-solving-large-scale-instances-of-the-shift-minimization-personnel-task-scheduling-problem-2017\/","title":{"rendered":"A four-phase meta-heuristic algorithm for solving large scale instances of the Shift minimization personnel task scheduling problem (2018)"},"content":{"rendered":"\n<h3 class=\"wp-block-heading\">Abstract<\/h3>\n\n\n\n<p>The Shift minimization personnel task scheduling problem (SMPTSP) is a known NP-hard problem. The present paper introduces a novel four-phase meta-heuristic approach for solving the Shift minimization personnel task scheduling problem which consists of an optimal assignment of jobs to multi-skilled employees, such that a minimal number of employees is used and no job is left unassigned. The computational results show that the proposed approach is able to find very good solutions in a very short time. The approach was tested and validated on the benchmarks from existing literature, managing to find very good solutions.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Citare<\/h3>\n\n\n\n<p>Nechita, S., Dio\u015fan, L., A four-phase meta-heuristic algorithm for solving large scale instances of the Shift minimization personnel task scheduling problem, SYNASC 2018, 2018, 394-400<br><a href=\"https:\/\/doi.org\/10.1109\/SYNASC.2018.00067\">https:\/\/doi.org\/10.1109\/SYNASC.2018.00067<\/a> <br><\/p>\n","protected":false},"excerpt":{"rendered":"<p>The Shift minimization personnel task scheduling problem (SMPTSP) is a known NP-hard problem. The present paper introduces a novel four-phase meta-heuristic approach for solving the Shift minimization personnel task scheduling problem which consists of an optimal assignment of jobs to multi-skilled employees, such that a minimal number of employees is used and no job is left unassigned. The computational results show that the proposed approach is able to find very good solutions in a very short time. The approach was tested and validated on the benchmarks from existing literature, managing to find very good solutions.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[4],"tags":[10,11],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/236"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/comments?post=236"}],"version-history":[{"count":3,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/236\/revisions"}],"predecessor-version":[{"id":1561,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/236\/revisions\/1561"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/media?parent=236"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/categories?post=236"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/tags?post=236"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}