Metaheuristic algorithms for balancing robotic assembly lines with sequence-dependent robot setup times

Janardhanan, Mukund Nilakantan; Li, Zixiang; Bocewicz, Grzegorz; Banaszak, Zbigniew; Nielsen, Peter

doi:10.1016/j.apm.2018.08.016

Cited by 57 publications

(33 citation statements)

References 39 publications

(47 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This considerably reduces the time and e®ort of a user À À À who would have to create a model for each question in the MP environment. Further research will focus on the application of the proposed framework to the scheduling processes in manufacturing, [20][21][22] transport and distribution networks 23 and logistics. 24 Fig.…”

Section: Discussionmentioning

confidence: 99%

A Constraint-Based Declarative Programming Framework for Scheduling and Resource Allocation Problems

Wikarek

Sitek

2019

Vietnam J. Comp. Sci.

View full text Add to dashboard Cite

Scheduling and resource allocation problems are widespread in many areas of today’s technology and management. Their different forms and structures appear in production, logistics, software engineering, computer networks, project and human resources management, services, etc. The literature (problem classification, scheduling and resource allocation models, solutions) is vast and exhaustive. In practice, however, classical scheduling problems with fixed structures and standard constraints (precedence, disjoint, etc.) are rare. Practical scheduling problems include also logical and nonlinear constraints, and they use nonstandard criteria of schedule evaluations. Indeed, in many cases, decision makers are interested in the feasibility and/or optimality of a given schedule for specified conditions formulated as general and/or specific questions. Thus, there is a need to develop a programming framework that will facilitate the modeling and solving of a variety of diverse scheduling problems. The framework should be able to (a) model any types of constraints, (b) ask questions/criteria relating to the schedule execution mode and (c) be highly effective in finding solutions (schedule development). This paper proposes such a constraint-based declarative programming framework for modeling and solving scheduling problems which satisfies the assumptions above. It was built with the Constraint Logic Programming (CLP) environment and supported with Mathematical Programming (MP). The functionality and effectiveness of this framework are presented with the use of an illustrative example for the resource-constrained scheduling problem with additional resources.

show abstract

Section: Discussionmentioning

confidence: 99%

A Constraint-Based Declarative Programming Framework for Scheduling and Resource Allocation Problems

Wikarek

Sitek

2019

Vietnam J. Comp. Sci.

View full text Add to dashboard Cite

show abstract

“…Migrating birds optimization (MBO) is a recent highperforming meta-heuristic algorithm inspired by the migrating bird's flight in a V-shaped formation, which has obtained competing performances in kinds of combinatorial optimization problems [38][39][40]. The main feature of MBO is sharing their neighbors with others, promoting the evolution of the whole swarm.…”

Section: The Basic Mbomentioning

confidence: 99%

Energy-Efficient Integration Optimization of Production Scheduling and Ladle Dispatching in Steelmaking Plants

2020

View full text Add to dashboard Cite

The existing production scheduling mode ignores ladle dispatching resulting in the increase of energy consumption in ladle heating and instability in production. Hence, we study the energy-efficient integration optimization of production scheduling and ladle dispatching in this paper. Specifically, a mixed integer linear programming model is formulated to coordinate the time-dependent correlations between them and quantify the energy consumption of them. Moreover, an enhanced migrating birds optimization algorithm (EMBO) is proposed to tackle this NP-hard integration optimization problem. In this proposed algorithm, a three-level rule-based heuristic decoding is designed to achieve the optimal solutions at the given production sequence; well-designed neighborhood structures are appended to intensify exploration; a simulated annealing-based acceptance criterion is hired to escape from local optima. Additionally, a novel competitive mechanism for birds regrouping is developed to increase the population diversity by information exchange between the left and right lines of Vformation. Mass experimental results demonstrate that the proposed EMBO observably outperforms all the compared algorithms, and the proposed integration optimization decreases the energy-consumption by 1.21% in the context of constant production efficiency.

show abstract

“…In accordance to the literature, AAPDO can be classified into a group of Human Resource Allocation Problems (HRAP), which is part of the generic Resource Allocation Problem (RAP), defined as the process of allocating resources between various projects [14][15][16][17][18][19][20][21]. A resource-a person, material or capital-undergoes the RAP process, which seeks an optimal allocation of a limited amount of resources to a number of tasks by optimising their objectives subject to given resource constraints [22].…”

Section: Literature Reviewmentioning

confidence: 99%

Interactive Planning of Competency-Driven University Teaching Staff Allocation

et al. 2020

Self Cite

View full text Add to dashboard Cite

This paper focuses on a teacher allocation problem that is specifically concerned with assigning available academic lecturers to remaining courses from a given student curriculum. The teachers are linked to tasks according to competencies, competence requirements enforced by the curriculum as well as the number and type of disruptions that hamper the fulfilment of courses. The problem under consideration boils down to searching links between competencies possessed by teachers and competencies required by the curricula that will, firstly, balance student needs and teacher workload and, secondly, ensure an assumed robustness level of the teaching schedule. The implemented interactive method performs iterative solving of analysis and synthesis problems concerned with alternative evaluation/robustness of the competency framework. Its performance is evaluated against a set of real historical data and arbitrarily selected sets of disruptions. The computational results indicate that our method yields better solutions compared to the manual allocation by the university.

show abstract

Metaheuristic algorithms for balancing robotic assembly lines with sequence-dependent robot setup times

Cited by 57 publications

References 39 publications

A Constraint-Based Declarative Programming Framework for Scheduling and Resource Allocation Problems

A Constraint-Based Declarative Programming Framework for Scheduling and Resource Allocation Problems

Energy-Efficient Integration Optimization of Production Scheduling and Ladle Dispatching in Steelmaking Plants

Interactive Planning of Competency-Driven University Teaching Staff Allocation

Contact Info

Product

Resources

About