Three types of information define a multipurpose batch scheduling problem; these are the recipes, the potential tasks to equipment units assignments, and the amount to be produced from each product. A recipe is considered as an entity that contains the minimum set of information that uniquely defines the manufacturing requirements for a specific product. Batch process scheduling problems are classified according to the properties of the intermediate materials, the equipment units, and the rules of materials transfers among them. One of the major classes follows the non-intermediate storage (NIS) policy where the intermediate materials have to be stored in the equipment units, and so an equipment unit becomes useful for the next task after the intermediate materials stored in this equipment unit are transferred to the equipment unit assigned to the next task in the recipe. The S-graph framework is an effective graph representation and algorithm developed for the NIS case. The nodes of an S-graph represent the tasks of the recipe and its arcs; arcs represent the precedence relationships of the tasks (recipe-arc) and the order of the application of an equipment unit (schedule-arc). There are two specific S-graphs, the recipe-graph and the schedule-graph. The former represents the recipe, the later a solution of a scheduling problem. Effective and user friendly software has been developed for the S-graph based scheduling of batch processes. The software is furnished with a user friendly graphical interface and an effective solver. While the interface is developed in Java, the solver in C++. The integration of the interface and solver has been carried out with XML-based communication standards. The present work demonstrates this software by solving both simple and complex problems. This software is freely available at www.dcs.vein.hu/capo/demo/sch.