Heuristics for the flexible job shop scheduling problem with a single active workplace on a machine in which different workplaces are available

In this research, we look into the world of heuristic approaches for production scheduling. We focus on the flexible job shop scheduling problem involving multi-workplace machines capable of serving only one workplace at the same time. We devised two heuristics for scheduling operations in scenarios where the task order within a job is specified and unspecified. In both modelled scenarios, the sequence of operations was predetermined. A heuristic uses the algorithm to carry out the planning process. The objective is to process all operations in the shortest amount of time, i.e., the makespan is to be minimized. Our aim in examining these heuristic approaches is to push the boundaries of production scheduling and offer insights into the latest methodologies.