0000000000121602

AUTHOR

Rubén Ruiz

showing 4 related works from this author

Two Simple Constructive algorithms for the Distributed Assembly Permutation Flowshop Scheduling Problem

2014

Nowadays, it is necessary to improve the management of complex supply chains which are often composed of multi-plant facilities. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP). This problem is a generalization of the Distributed Permutation Flowshop Scheduling Problem (DPFSP) presented by Naderi and Ruiz (Comput Oper Res, 37(4):754–768, 2010). The first stage of the DAPFSP is composed of f identical production factories. Each center is a flowshop that produces jobs that have to be assembled into final products in a second assembly stage. The objective is to minimize the makespan. Two simple constructive algorithms are proposed to solve the proble…

PermutationMathematical optimizationJob shop schedulingSimple (abstract algebra)GeneralizationSupply chainConstructive algorithmsProduction (computer science)Mathematics
researchProduct

Integer programming models for the pre-marshalling problem

2019

[EN] The performance of shipping companies greatly depends on reduced berthing times. The trend towards bigger ships and shorter berthing times places severe stress on container terminals, which cannot simply increase the available cranes indefinitely. Therefore, the focus is on optimizing existing resources. An effective way of speeding up the loading/unloading operations of ships at the container terminal is to use the idle time before the arrival of a ship for sorting the stored containers in advance. The pre-marshalling problem consists in rearranging the containers placed in a bay in the order in which they will be required later, looking for a sequence with the minimum number of moves…

OptimizationMathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputer scienceESTADISTICA E INVESTIGACION OPERATIVA0211 other engineering and technologies02 engineering and technologyLogisticsManagement Science and Operations ResearchUpper and lower boundsIndustrial and Manufacturing EngineeringMarshalling0502 economics and businessPre-marshallingInteger programmingStorage area050210 logistics & transportationFocus (computing)Sequence021103 operations research05 social sciencesSortingInteger programmingTerminal (electronics)Modeling and SimulationContainer (abstract data type)
researchProduct

Matheuristics for the irregular bin packing problem with free rotations

2017

[EN] We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientation…

Mathematical optimization021103 operations researchInformation Systems and ManagementGeneral Computer ScienceBin packing problemESTADISTICA E INVESTIGACION OPERATIVA0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchStrip packingTwo-dimensional irregular bin packingConstructiveIndustrial and Manufacturing EngineeringBinCutting and packingSet packingCutting stock problemModeling and Simulation0202 electrical engineering electronic engineering information engineeringInteger Programing020201 artificial intelligence & image processingFree rotationFinite setMathematics
researchProduct

The distributed assembly permutation flowshop scheduling problem

2013

Nowadays, improving the management of complex supply chains is a key to become competitive in the twenty-first century global market. Supply chains are composed of multi-plant facilities that must be coordinated and synchronised to cut waste and lead times. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) with two stages to model and study complex supply chains. This problem is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP). The first stage of the DAPFSP is composed of f identical production factories. Each one is a flowshop that produces jobs to be assembled into final products in a second assembly stage. The o…

Mathematical optimizationJob shop schedulingStrategy and ManagementSupply chainESTADISTICA E INVESTIGACION OPERATIVANeighbourhood (graph theory)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringDistributed assembly flowshopVariable neighborhood descentVariable (computer science)PermutationConstructive algorithmsKey (cryptography)ORGANIZACION DE EMPRESASProduction (computer science)Mathematics
researchProduct