Scheduling in a Kanban-controlled flowshop with dual blocking mechanisms and missing operations for part-types

We address the problem of scheduling in a Kanban-controlled flowshop with dual blocking mechanisms. The flowshop is also characterized by missing operations for part-types. We first present recursive equations for time-tabling of containers in a given sequence. We then present two heuristics for scheduling with the objectives of minimizing the sum of weighted waiting-time of containers and weighted flowtime of part-types. An extensive computational evaluation of the proposed heuristics is also presented.