A Scheduling Problem to Minimize Total Weighted Tardiness in the Two-Stage Assembly Flowshop

Abstract EN

This paper considers an assembly scheduling problem which minimizes the total weighted tardiness.

The system consists of multiple manufacturing machines in the first stage and an assembly machine in the second stage.

A job is composed of multiple components, each component is manufactured on a dedicated machine in the first stage, and the assembly starts on the assembly machine after the completion of all the components’ manufacturing in the first stage.

This paper is to try to find effective and efficient schedules to minimize the total weighted tardiness of jobs.

This paper analyzes some solution properties to improve search effectiveness and efficiency.

Moreover, some lower-bound procedures are derived, and then four constructive heuristics and a branch-and-bound algorithm are suggested.

The performances of the derived algorithms are evaluated through numerical experiments.

For the problems with no more than 15 jobs, the branch-and-bound algorithm finds the optimal solutions within 20 minutes, and the performance of the four heuristics seems to be similar.

However, for problems with more than 30 jobs, HWT shows the best performance among the four heuristics except for two machines.