An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
View/Open
An iterated greedy algorithm for minimizing total tardiness in PBFSP 301018.docx (264,1Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
An iterated greedy algorithm for minimizing total tardiness in PBFSP 301018.docx (264,1Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/127883
Document typeArticle
Defense date2019-05-01
Rights accessRestricted access - publisher's policy
(embargoed until 2021-05-01)
Abstract
This paper proposes an iterated greedy algorithm for scheduling jobs in F parallel flow shops (lines), each consisting of a series of m machines without storage capacity between machines. This constraint can provoke the blockage of machines if a job has finished its operation and the next machine is not available. The criterion considered is the minimization of the sum of tardiness of all the jobs to schedule, i.e., minimization of the total tardiness of jobs. Notice that the proposed method is also valid for solving the Distributed Permutation Blocking Flow Shop Scheduling Problem (DBFSP), which allows modelling the scheduling process in companies with more than one factory when each factory has an identical flow shop configuration. Firstly, several constructive procedures have been implemented and tested to provide an efficient solution in terms of quality and CPU time. This initial solution is later improved upon with an iterated greedy algorithm that includes a variable neighbourhood search for interchanging or reassigning jobs from the critical line to other lines. Next, two strategies have been tested for selecting the critical line; the one with a higher total tardiness of jobs and the one with a job that has the highest tardiness. The experimental design chooses the best combination of initial solution and critical line selection. Finally, we compare the performance of the proposed algorithm against other benchmark algorithms proposed for the DPFSP, which have been adapted to the problem being considered here since, to the best of our knowledge, this is the first attempt to solve either the Parallel Blocking Flow Shop problem or the Distributed Blocking Flow Shop problem with the goal of minimizing total tardiness. This comparison has allowed us to confirm the good performance of the proposed method.
CitationRibas, I.; Companys , R.; Tort, X. An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. "Expert systems with applications", 1 Maig 2019, vol. 121, p. 347-361.
ISSN0957-4174
Publisher versionhttps://www.sciencedirect.com/science/article/pii/S0957417418308078
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
An iterated gre ... iness in PBFSP 301018.docx![]() | 264,1Kb | Microsoft Word 2007 | Restricted access | |
An iterated gre ... iness in PBFSP 301018.docx![]() | 264,1Kb | Microsoft Word 2007 | Restricted access |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain