toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Author Mejia, G.; Pereira, J. doi  openurl
  Title Multiobjective scheduling algorithm for flexible manufacturing systems with Petri nets Type
  Year 2020 Publication Journal Of Manufacturing Systems Abbreviated Journal J. Manuf. Syst.  
  Volume 54 Issue Pages 272-284  
  Keywords Machine scheduling; Multi-objective optimization; Petri nets  
  Abstract In this work, we focus on general multi-objective scheduling problems that can be modeled using a Petri net framework. Due to their generality, Petri nets are a useful abstraction that captures multiple characteristics of real-life processes. To provide a general solution procedure for the abstraction, we propose three alternative approaches using an indirect scheme to represent the solution: (1) a genetic algorithm that combines two objectives through a weighted fitness function, (2) a non dominated sorting genetic algorithm (NSGA-II) that explicitly addresses the multi-objective nature of the problem and (3) a multi-objective local search approach that simultaneously explores multiple candidate solutions. These algorithms are tested in an extensive computational experiment showing the applicability of this general framework to obtain quality solutions.  
  Address [Mejia, Gonzalo] Univ La Sabana, Fac Engn, Campus Puente del Comun, Chia, Colombia, Email: gonzalo.mejia@unisabana.edu.co;  
  Corporate Author Thesis  
  Publisher Elsevier Sci Ltd Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0278-6125 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000521511500021 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 1154  
Permanent link to this record
 

 
Author Yuraszeck, F.; Mejia, G.; Pereira, J.; Vila, M. doi  openurl
  Title A Novel Constraint Programming Decomposition Approach for the Total Flow Time Fixed Group Shop Scheduling Problem Type
  Year 2022 Publication Mathematics Abbreviated Journal Mathematics  
  Volume 10 Issue 3 Pages 329  
  Keywords scheduling; fixed group shop; group shop; constraint programming  
  Abstract This work addresses a particular case of the group shop scheduling problem (GSSP) which will be denoted as the fixed group shop scheduling problem (FGSSP). In a FGSSP, job operations are divided into stages and each stage has a set of machines associated to it which are not shared with the other stages. All jobs go through all the stages in a specific order, where the operations of the job at each stage need to be finished before the job advances to the following stage, but operations within a stage can be performed in any order. This setting is common in companies such as leaf spring manufacturers and other automotive companies. To solve the problem, we propose a novel heuristic procedure that combines a decomposition approach with a constraint programming (CP) solver and a restart mechanism both to avoid local optima and to diversify the search. The performance of our approach was tested on instances derived from other scheduling problems that the FGSSP subsumes, considering both the cases with and without anticipatory sequence-dependent setup times. The results of the proposed algorithm are compared with off-the-shelf CP and mixed integer linear programming (MILP) methods as well as with the lower bounds derived from the study of the problem. The experiments show that the proposed heuristic algorithm outperforms the other methods, specially on large-size instances with improvements of over 10% on average.  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 2227-7390 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000756126100001 Approved  
  Call Number UAI @ alexi.delcanto @ Serial 1549  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: