Modified genetic algorithm to solve worker assignment problem with time windows

Abstract

Abstract In recent years, the demand for electronic products has been increasing rapidly. T mounting technology (SMT) line is one of the production areas for electronic products, directly affecting this situation. In an SMT line, multiple machines mount electronic parts to the board. The worker must complete work when the parts used in these machines are within the remaining parts available for replacement. When a worker fails to replace parts at the right time, the production line stops, and delays occur. Besides, there may be a designated worker who should be assigned to each task. In the current situation, workers’ work procedures are not optimized, so they should schedule work procedures for each worker. This problem is called Worker Assignment Problem with Time Window (WAPTW). This paper proposes a method to solve WAPTW called Genetic Algorithm with Local Restriction (GALR). GALR combines a genetic algorithm (GA) and local search with local restriction. This paper’s main contribution is introducing WAPTW as a novel real-world optimization problem in an electricity company, its mathematical formulation, and a proposed GALR to solve WAPTW. The experiment shows that the proposed method could yield the best result in real-world WAPTW compared with other methods.

Keywords

• Worker assignment
• Genetic algorithm
• Local search
• Local restriction