Internet-based exercises and mini-exams for production and operations management

The purpose of the internet-based teachware mySCM is that students of economics, informatics and industrial engineering get familiar with quantitative methods for supply chain management. Input-output-relationships of various optimization methods can be detected by sampling input values, parameters, and alternative methods for the same problem. Students can gain extra benefits by passing so-called mini-exams that motivate active learning. mySCM can be used for free, round-the-clock, and any place where access to the Internet is available.

Heuristic decomposition and LP-based scheduling in make-and-pack production

In this paper, we are concerned about the short-term scheduling of industrial make-and-pack production processes. The planning problem consists in minimizing the production makespan while meeting given end-product demands. Sequence-dependent changeover times, multi-purpose storage units with finite capacities, quarantine times, batch splitting, partial equipment connectivity, material transfer times, and a large number of operations contribute to the complexity of the problem. Known MILP formulations cover all technological constraints of such production processes, but only small problem instances can be solved in reasonable CPU times. In this paper, we develop a heuristic in order to tackle large instances. Under this heuristic, groups of batches are scheduled iteratively using a novel MILP formulation; the assignment of the batches to the groups and the scheduling sequence of the groups are determined using a priority rule. We demonstrate the applicability by means of a real-world production process.