A study of heuristic approach to daily production scheduling

The daily scheduling for allocating a number of products of low demand to tens of machines of the same type is considered. The production continues throughout the day and one day is divided into a 3 production-unit span. The scheduling is, of course, requested to be as continuous and uniform as possible, and, in addition, a machine’s production ability diminishes greatly if a change of product occurs during the production-unit span. The demand for each product is given daily, and the problem is that it doesn’t mesh with the production ability within the production-unit span. This scheduling problem involves the need for variables to be integer and the paper resolves this by revising a heuristic approach which embeds integer condition into several procedures. These procedures are based on iterative averaging allocation method which resembles the dynamic programming method. [In Japanese.]