Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers

The problem of scheduling in a Kanban flowshop is considered with the objec tive of minimizing the sum of weighted flowtime, weighted tardiness and wei ghted earliness of containers. The Kanban flowshop is characterized by the presence of separate input and output buffers between workstations, materia l handling between workstations, blocking mechanism due to part-type, Produ ction and Withdrawal Kanbans, and setup times separated from process times of containers. First, mathematical formulations for time-tabling of contain ers for different types of problems are proposed. The development of a simp le heuristic to minimize the sum of weighted flowtime, weighted tardiness a nd weighted earliness of containers is subsequently presented. An improveme nt scheme is supplemented to the proposed heuristic to enhance the quality of the final solution. The proposed heuristic and the existing heuristics a re evaluated in a large number of randomly generated problems of different sizes.