Larysa Burtseva - Academia.edu (original) (raw)
Papers by Larysa Burtseva
The objective of this work is to reduce the machine downtime due to setup times during the electr... more The objective of this work is to reduce the machine downtime due to setup times during the electrical test in a semiconductor packaging company, whose products has high volume-high mixture characteristics. The group technology is adapted for the plant production workflow modeling. Based on the real data of the production floor, a taxonomy of setup times was developed. The compatibility of different package geometries was validated to build product families. As a result, a flexible batch sequencing model is obtained. The model is implemented in the plant showing an increment of 25.93% of the installed capacity in a pilot test and of 12% under real conditions. The proposed batch sequencing model is exportable to any discrete manufacturing business, which has to sequence production orders.
Int. J. Comb. Optim. Probl. Informatics, 2015
P { margin-bottom: 0.21cm; } The scheduling problems in Manufacturing Systems are characterized b... more P { margin-bottom: 0.21cm; } The scheduling problems in Manufacturing Systems are characterized by a high degree of uncertainties arising from diverse factors such as stochastic environments and data incompleteness. However, traditionally the schedules generated for those environments are deterministic, or quasi-deterministic at the best, and only recently the approach static is being shifted for a stochastic approach. This paper highlights the uncertainty characteristics that should be taken into account to improve the schedule robustness. In this research, selected cases from the last ten years of stochastic scheduling literature are reviewed, specially the ones relatives to Semiconductor Factories. Another important objective of our report is to bring the attention of researchers to emerging methodologies and technologies coming from the subject of Knowledge Representation and Reasoning. These new methodologies and technologies are well suited to solve hard combinatorial problems...
Within an electrical test planning system in the semiconductor industry, various models that allo... more Within an electrical test planning system in the semiconductor industry, various models that allow a better utilization of installed capacity were developed. The workflow in the plant and the information flow in the electrical test planning area were analyzed in order to minimize setup times on the equipment. A paradigm shift is proposed, with which planning is done at the product family level instead of at the level of the part number, always starting with priority products required by the market.
In recent years, Linux has been employed to execute numerous real-time applications. However, it ... more In recent years, Linux has been employed to execute numerous real-time applications. However, it is limited to support soft real-time systems. For real-time systems with critical constraints, the soft real-time support and the scheduling policies offered by Linux are still insufficient. In this work, the Earliest Deadline First scheduling policy, which has been shown in theory to be an optimal one in uniprocessor systems, is introduced as an extension of the Linux kernel. This policy is implemented into the real-time class, without the necessity of defining an additional class. The Linux kernel affords capabilities of a hard real-time operating system by an RT-Preempt patch, enabling the use of Linux to implement hard real-time systems. The integration is compliant with the POSIX real-time and thread standards, ensuring applications portability, employing the GLIBC library. In order to validate the proposed implementation, a set of experiments is conducted, showing that a real-time ...
Bulletin of Kharkov National Automobile and Highway University, 2018
Goal. The objective of this work is to propose a model that allows one to obtain velocity and dir... more Goal. The objective of this work is to propose a model that allows one to obtain velocity and direction of spherical hard-bodies after a collision, using Molecular Dynamics (MD) methods. Molecular simulations are employed to compute the properties and predict behaviors of solids, liquids and gases; the consideration of collisions between particles is fundamental, since they represent a change of energy in the system. Collisions are also associated with a wide range of applications such as robotics, car traffic safety, videogames, materials science, colloids, among others; some of them can be interpreted as elastic collisions between hard-spheres. Problem. Some algorithms of MD use periodic boundaries, in which the particles can move, instead of a restricted space. However, more realistic applications require algorithms to model collisions in closed spaces. Originality. Equations to model the collision in restricted spaces were developed to obtain the velocities of the spheres that collide with the wall(s) of the container; these formulas are valid when the walls are straight, for example in cylinders and cubes. Methodology. A simulation of a hard-sphere system in a cylinder was developed using the fundamentals of MD and the proposed equations to model collisions, in MATLAB. Properties of the system were computed: the atomic packing fraction (APF), which represents the space occupied by atoms in the container; and the equilibrium structure was characterized by the radial distribution function g(r) (RDF), which is proportional to the probability of finding two atoms separated by the distance r + r. Results. The APF of the system was 0.2%, and the frequency of collisions in the equilibrium stage was 2.2810×10 3 Hz, while in the production stage was 1.3995×10 5 Hz. Practical value-This model can be used not only for atoms/molecules that collide, but also for some rigid bodies. In a future work, particle collisions in irregular-shape containers will be modeled since in real systems, the channels are constricted spaces.
Bulletin of Kharkov National Automobile and Highway University, 2018
Cyber-physical systems in Industry 4.0 are comprised of a computational core, a communication cor... more Cyber-physical systems in Industry 4.0 are comprised of a computational core, a communication core, and a physical system. The computational core has strict timing restrictions and represents a Real-time system. In this paper, the modeling of the computational core is discussed.
Future Manufacturing Systems, 2010
The purpose of this chapter is to present a class of deterministic scheduling problems in a multi... more The purpose of this chapter is to present a class of deterministic scheduling problems in a multi-stage parallel machine environment called hybrid flow shop with setup times and appropriate methods for its resolution. The chapter includes a description of model with necessary definitions and notations; concepts of product family and batch, which are important elements of setup time analysis as well as a classification of setup times and problems that each category produces. The last section is focused on problems with sequence-depended setup times in hybrid flow shops. A review of investigated cases is explained, including the application of genetic algorithms for this kind of scheduling problems: structure of a genetic algorithm and description of several crossover operators appropriated to use based on previous investigations of authors. This section includes an algorithm and an example of a complex problem solution. A conclusion is presented at the chapter end.
Lecture Notes in Computer Science, 2012
This paper addresses non-preemptive offline scheduling parallel jobs on a Grid. We consider a Gri... more This paper addresses non-preemptive offline scheduling parallel jobs on a Grid. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable Grid site, while at the second stage, local scheduling is independently applied to each site. In this environment, one of the big challenges is to provide a job allocation that allows more efficient use of resources and user satisfaction. In general, the criteria that help achieve these goals are often in conflict. To solve this problem, two-objective genetic algorithm is proposed. We conduct comparative analysis of five crossover and three mutation operators, and determine most influential parameters and operators. To this end multi factorial analysis of variance is applied.
Production Scheduling, 2012
Section 3. Disturbances modeling in biomedical sensors systems Chapter 10. Digital analysis and t... more Section 3. Disturbances modeling in biomedical sensors systems Chapter 10. Digital analysis and treatment for electromagnetic disturbances in biomedical instrumentation
MDPI, 2020
This is the Printed Edition of a Special Issue with the same title in the journal Algorithms. It ... more This is the Printed Edition of a Special Issue with the same title in the journal Algorithms. It contains a preface and 8 papers. The pdf file can be freely downloaded from the link below.
The properties of nanoparticles confined in microscopic spaces within porous materials may differ... more The properties of nanoparticles confined in microscopic spaces within porous materials may differ significantly from those in the free state due to the interface interaction. The attributes of constrained geometries make these structures unique and
Computer Systems Science and Engineering
Algorithms
This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for... more This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for Scheduling Problems’. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms. Submissions were welcome both for traditional scheduling problems as well as for new practical applications. In the Call for Papers, we mentioned topics such as single-criterion and multi-criteria scheduling problems with additional constraints including setup times (costs), precedence constraints, batching (lot sizing), resource constraints as well as scheduling problems arising in emerging applications.
Algorithms
This special issue of Algorithms is devoted to the development of scheduling algorithms based on ... more This special issue of Algorithms is devoted to the development of scheduling algorithms based on innovative approaches for solving hard scheduling problems either exactly or approximately. Submissions were welcome both for traditional scheduling problems as well as for new practical applications. The main topics include sequencing and scheduling with additional constraints (setup times or costs, precedence constraints, resource constraints, and batch production environment) and production planning and scheduling problems arising in real-world applications.
Materials
The authors have found two errors in the paper published in Materials [...]
This is a printed edition of a special issue on Algorithms for Scheduling Problems published in t... more This is a printed edition of a special issue on Algorithms for Scheduling Problems published in the journal Algorithms. The Ebook is freely downloadable from the publisher's website given in the link.
Materials (Basel, Switzerland), Jan 5, 2018
The filling of channels in porous media with particles of a material can be interpreted in a firs... more The filling of channels in porous media with particles of a material can be interpreted in a first approximation as a packing of spheres in cylindrical recipients. Numerous studies on micro- and nanoscopic scales show that they are, as a rule, not ideal cylinders. In this paper, the channels, which have an irregular shape and a circular cross-section, as well as the packing algorithms are investigated. Five patterns of channel shapes are detected to represent any irregular porous structures. A novel heuristic packing algorithm for monosized spheres and different irregularities is proposed. It begins with an initial configuration based on an unit cell and the subsequent densification of the obtained structure by shaking and gravity procedures. A verification of the algorithm was carried out for nine sinusoidal axisymmetric channels with different ratio by MATLAB simulations, reaching a packing fraction of at least 0.67 (for sphere diameters of 5% or less), superior to a random close ...
The objective of this work is to reduce the machine downtime due to setup times during the electr... more The objective of this work is to reduce the machine downtime due to setup times during the electrical test in a semiconductor packaging company, whose products has high volume-high mixture characteristics. The group technology is adapted for the plant production workflow modeling. Based on the real data of the production floor, a taxonomy of setup times was developed. The compatibility of different package geometries was validated to build product families. As a result, a flexible batch sequencing model is obtained. The model is implemented in the plant showing an increment of 25.93% of the installed capacity in a pilot test and of 12% under real conditions. The proposed batch sequencing model is exportable to any discrete manufacturing business, which has to sequence production orders.
Int. J. Comb. Optim. Probl. Informatics, 2015
P { margin-bottom: 0.21cm; } The scheduling problems in Manufacturing Systems are characterized b... more P { margin-bottom: 0.21cm; } The scheduling problems in Manufacturing Systems are characterized by a high degree of uncertainties arising from diverse factors such as stochastic environments and data incompleteness. However, traditionally the schedules generated for those environments are deterministic, or quasi-deterministic at the best, and only recently the approach static is being shifted for a stochastic approach. This paper highlights the uncertainty characteristics that should be taken into account to improve the schedule robustness. In this research, selected cases from the last ten years of stochastic scheduling literature are reviewed, specially the ones relatives to Semiconductor Factories. Another important objective of our report is to bring the attention of researchers to emerging methodologies and technologies coming from the subject of Knowledge Representation and Reasoning. These new methodologies and technologies are well suited to solve hard combinatorial problems...
Within an electrical test planning system in the semiconductor industry, various models that allo... more Within an electrical test planning system in the semiconductor industry, various models that allow a better utilization of installed capacity were developed. The workflow in the plant and the information flow in the electrical test planning area were analyzed in order to minimize setup times on the equipment. A paradigm shift is proposed, with which planning is done at the product family level instead of at the level of the part number, always starting with priority products required by the market.
In recent years, Linux has been employed to execute numerous real-time applications. However, it ... more In recent years, Linux has been employed to execute numerous real-time applications. However, it is limited to support soft real-time systems. For real-time systems with critical constraints, the soft real-time support and the scheduling policies offered by Linux are still insufficient. In this work, the Earliest Deadline First scheduling policy, which has been shown in theory to be an optimal one in uniprocessor systems, is introduced as an extension of the Linux kernel. This policy is implemented into the real-time class, without the necessity of defining an additional class. The Linux kernel affords capabilities of a hard real-time operating system by an RT-Preempt patch, enabling the use of Linux to implement hard real-time systems. The integration is compliant with the POSIX real-time and thread standards, ensuring applications portability, employing the GLIBC library. In order to validate the proposed implementation, a set of experiments is conducted, showing that a real-time ...
Bulletin of Kharkov National Automobile and Highway University, 2018
Goal. The objective of this work is to propose a model that allows one to obtain velocity and dir... more Goal. The objective of this work is to propose a model that allows one to obtain velocity and direction of spherical hard-bodies after a collision, using Molecular Dynamics (MD) methods. Molecular simulations are employed to compute the properties and predict behaviors of solids, liquids and gases; the consideration of collisions between particles is fundamental, since they represent a change of energy in the system. Collisions are also associated with a wide range of applications such as robotics, car traffic safety, videogames, materials science, colloids, among others; some of them can be interpreted as elastic collisions between hard-spheres. Problem. Some algorithms of MD use periodic boundaries, in which the particles can move, instead of a restricted space. However, more realistic applications require algorithms to model collisions in closed spaces. Originality. Equations to model the collision in restricted spaces were developed to obtain the velocities of the spheres that collide with the wall(s) of the container; these formulas are valid when the walls are straight, for example in cylinders and cubes. Methodology. A simulation of a hard-sphere system in a cylinder was developed using the fundamentals of MD and the proposed equations to model collisions, in MATLAB. Properties of the system were computed: the atomic packing fraction (APF), which represents the space occupied by atoms in the container; and the equilibrium structure was characterized by the radial distribution function g(r) (RDF), which is proportional to the probability of finding two atoms separated by the distance r + r. Results. The APF of the system was 0.2%, and the frequency of collisions in the equilibrium stage was 2.2810×10 3 Hz, while in the production stage was 1.3995×10 5 Hz. Practical value-This model can be used not only for atoms/molecules that collide, but also for some rigid bodies. In a future work, particle collisions in irregular-shape containers will be modeled since in real systems, the channels are constricted spaces.
Bulletin of Kharkov National Automobile and Highway University, 2018
Cyber-physical systems in Industry 4.0 are comprised of a computational core, a communication cor... more Cyber-physical systems in Industry 4.0 are comprised of a computational core, a communication core, and a physical system. The computational core has strict timing restrictions and represents a Real-time system. In this paper, the modeling of the computational core is discussed.
Future Manufacturing Systems, 2010
The purpose of this chapter is to present a class of deterministic scheduling problems in a multi... more The purpose of this chapter is to present a class of deterministic scheduling problems in a multi-stage parallel machine environment called hybrid flow shop with setup times and appropriate methods for its resolution. The chapter includes a description of model with necessary definitions and notations; concepts of product family and batch, which are important elements of setup time analysis as well as a classification of setup times and problems that each category produces. The last section is focused on problems with sequence-depended setup times in hybrid flow shops. A review of investigated cases is explained, including the application of genetic algorithms for this kind of scheduling problems: structure of a genetic algorithm and description of several crossover operators appropriated to use based on previous investigations of authors. This section includes an algorithm and an example of a complex problem solution. A conclusion is presented at the chapter end.
Lecture Notes in Computer Science, 2012
This paper addresses non-preemptive offline scheduling parallel jobs on a Grid. We consider a Gri... more This paper addresses non-preemptive offline scheduling parallel jobs on a Grid. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable Grid site, while at the second stage, local scheduling is independently applied to each site. In this environment, one of the big challenges is to provide a job allocation that allows more efficient use of resources and user satisfaction. In general, the criteria that help achieve these goals are often in conflict. To solve this problem, two-objective genetic algorithm is proposed. We conduct comparative analysis of five crossover and three mutation operators, and determine most influential parameters and operators. To this end multi factorial analysis of variance is applied.
Production Scheduling, 2012
Section 3. Disturbances modeling in biomedical sensors systems Chapter 10. Digital analysis and t... more Section 3. Disturbances modeling in biomedical sensors systems Chapter 10. Digital analysis and treatment for electromagnetic disturbances in biomedical instrumentation
MDPI, 2020
This is the Printed Edition of a Special Issue with the same title in the journal Algorithms. It ... more This is the Printed Edition of a Special Issue with the same title in the journal Algorithms. It contains a preface and 8 papers. The pdf file can be freely downloaded from the link below.
The properties of nanoparticles confined in microscopic spaces within porous materials may differ... more The properties of nanoparticles confined in microscopic spaces within porous materials may differ significantly from those in the free state due to the interface interaction. The attributes of constrained geometries make these structures unique and
Computer Systems Science and Engineering
Algorithms
This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for... more This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for Scheduling Problems’. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms. Submissions were welcome both for traditional scheduling problems as well as for new practical applications. In the Call for Papers, we mentioned topics such as single-criterion and multi-criteria scheduling problems with additional constraints including setup times (costs), precedence constraints, batching (lot sizing), resource constraints as well as scheduling problems arising in emerging applications.
Algorithms
This special issue of Algorithms is devoted to the development of scheduling algorithms based on ... more This special issue of Algorithms is devoted to the development of scheduling algorithms based on innovative approaches for solving hard scheduling problems either exactly or approximately. Submissions were welcome both for traditional scheduling problems as well as for new practical applications. The main topics include sequencing and scheduling with additional constraints (setup times or costs, precedence constraints, resource constraints, and batch production environment) and production planning and scheduling problems arising in real-world applications.
Materials
The authors have found two errors in the paper published in Materials [...]
This is a printed edition of a special issue on Algorithms for Scheduling Problems published in t... more This is a printed edition of a special issue on Algorithms for Scheduling Problems published in the journal Algorithms. The Ebook is freely downloadable from the publisher's website given in the link.
Materials (Basel, Switzerland), Jan 5, 2018
The filling of channels in porous media with particles of a material can be interpreted in a firs... more The filling of channels in porous media with particles of a material can be interpreted in a first approximation as a packing of spheres in cylindrical recipients. Numerous studies on micro- and nanoscopic scales show that they are, as a rule, not ideal cylinders. In this paper, the channels, which have an irregular shape and a circular cross-section, as well as the packing algorithms are investigated. Five patterns of channel shapes are detected to represent any irregular porous structures. A novel heuristic packing algorithm for monosized spheres and different irregularities is proposed. It begins with an initial configuration based on an unit cell and the subsequent densification of the obtained structure by shaking and gravity procedures. A verification of the algorithm was carried out for nine sinusoidal axisymmetric channels with different ratio by MATLAB simulations, reaching a packing fraction of at least 0.67 (for sphere diameters of 5% or less), superior to a random close ...
Many researchers and research groups around the globe are dealing with interdisciplinary problems... more Many researchers and research groups around the globe are dealing with interdisciplinary problems and multidisciplinary groups; but especially those that deal everyday with biosensors have the feeling of not having enough personnel with the sufficient background to cover all topics. With this feeling in our minds, we decided to invite wonderful researchers from different parts to design this book, not as a conventional biosensor’s book, but as an interesting journey in the complex world of biosensors.
A close look to some recent and key advances on the topic, but at the same time tips through novel mathematical modelling to improve our work, and last but not least, tricks to fool those undesired electrical disturbances that commonly messes our daily work can be found in these pages.
Feel free to navigate the book through its chapters, once in your hands you will feel eager to learn more about biosensors. It has been an experience to put all this together; but now, with the book ready, we can say that this trip has being a wonderful adventure. That is why want to thank all the authors for their great contributions, the Editorial and Irene for their constant input, and to you, the reader, for being part of this book.