Problem Statement

2. Laptop Assembly In a factory, N workers are involved in a streamlined process of assembling M laptops in a conveyor belt system. The laptops have to be assembled in sequence from laptop 1 to laptop M . For each laptop, the workers have to do their job in sequence from worker 1 to worker N . Every laptop to be assembled has a factor of complexity, F . Each worker is responsible for a specific stage of the laptop assembly process, and the time taken (in minutes) by a worker to complete their part of the job on a laptop of complexity 1 is denoted by T . Therefore, the time needed for worker i to finish their part of the job on laptop j is computed as the product T i F j . To avoid any pileup on open laptops, as soon as worker i completes their part, the laptop has to be immediately passed on to worker i+1 without any delay. Therefore, the starting time of assembling each laptop has to be managed such that all workers will be available when it is their turn to work on the laptop. Your t