Design of multi-product manufacturing lines with the consideration of product change dependent inter-task times, reduced changeover and machine flexibility

Design of reconfigurable manufacturing systems

“…Such considerations may optimize task-station assignments in mixed-model production, thereby reducing line changeover times and perhaps having some impact on RMS capital costs [39]. Nevertheless, the system design approach in this paper suggests that a new manufacturing system should be designed each time a new product is introduced.…”

Combinatorial Benders cuts for assembly line balancing problems with setups

“…The number of necessary performing orders between tasks in any workstation is calculated by the constraint set (17). The set of constraints (18) guarantees that each task in any workstation would have at most one immediate successor. It is possible to do only one forward setup operation between any pair of tasks due to constraints (19) and there would not be any forward setup operation between any task and itself due to constraints (20).…”

“…A mixed-integer programming formulation for another version of the problem where setup times were considered for a two sided assembly line was presented in [20], for which the authors proposed a heuristic. The mixed-model version of the assembly line balancing problem with setups was studied in [18], and the variant with sequence dependent setup times between tasks was studied in [2], and hybrid meta-heuristic algorithms, including a combination of ant colony optimization and genetic algorithm and a multiple colony hybrid bees algorithm were described in [1] and [3].…”

Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach

“…1, the solution S = (1,1,1), (3,1,3), (2,1,2), (3,2,1), (2,2,3), (1,2,2), (1,3,2), (2,3,1), (2,4,2) is one of the feasible solutions from the solution space for the mentioned problem. The representation of this solution in the task sequencing list format is provided in Fig.…”

“…The majority of such research focused on the 'operation' time, time of pure value-adding processes; such conventional research usually assumed that the time spent between two tasks was zero, or the setup times were constant regardless of task order. However, some research has shown that, in many real situations, task sequences significantly affect the sizes of setup times [2]. Considering this assumption, not only setup times are not counted as a trivial part of processing times, but are also separately studied as an effective factor in operation scheduling.…”