The bin packing problem can be best described in 'transportation' terms: given a set of boxes of different sizes, how should one pack them all into containers of a given size, in order to use as few containers as possible? The task of balancing of (robotized) assembly lines is of considerable industrial importance. It consists of assigning operations from a given set to workstations in a produc...

Most of the decision support systems for balancing industrial assembly lines are designed to report a huge number of possible line configurations, according to several criteria. In this contribution, we tackle a more realistic variant of the classical assembly line problem formulation, time and space assembly line balancing. Our goal is to study the influence of incorporating user preferences b...

Assembly line balancing problems (ALBPs) arise whenever an assembly line is configured, redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturing products among the work stations along the line. On the one hand, research has focussed on developing effective and fast solution methods for exactly solving the simple assembly line balancing problem (SALBP). On th...

This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...

Assembly line balancing is significant for efficient and cost effective production of the products and is therefore gaining popularity in recent years. However, several uncertain events in assembly lines might causes variation in the task time and due to these variations there always remains a possibility that completion time of tasks might exceed the predefined cycle time. To hedge against thi...

We present a new mechanism to introduce diversity into two multiobjective approaches based on ant colony optimisation and randomised greedy algorithms to solve a more realistic extension of a classical industrial problem: time and space assembly line balancing. Promising results are shown after applying the designed constructive metaheuristics to ten real-like problem instances.