This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

in this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). no set-up is necessary between jobs belonging to the same family. a set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i  j, the duration of this set-up being the sequ...

This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...

Parallel-machine scheduling research is one of the active fields in the past decade due to its increasing application. Due to the problem complexity, it is a general practice to find an appropriate heuristic rather than an optimal solution for the parallel-machine scheduling problem. The wirebonding workstation is the bottleneck in integrated-circuit packaging manufacturing. Effective schedulin...

This study deals with an unrelated parallel machine scheduling problem additional resources (UPMR). That is one of the important sub-problems in scheduling. UPMR consists a set jobs on machines. In addition to that, number or more are needed. very and its importance comes from wealth applications; they applicable engineering scientific situations manufacturing systems such as industrial robots,...

The unrelated parallel machine scheduling problem aims to assign jobs independent machines with sequence-dependent setup times so that the makespan is minimized. When many practical considerations are introduced, solving resulting challenging, especially when problems of realistic sizes interest. In this study, in addition conventional objective minimizing makespan, we further consider burn-in ...