Effectiveness of an Online Social Constructivist Mathematical Problem Solving Course for Malaysian Pre-Service Teachers

This study assessed the effectiveness of an online mathematical problem solving course designed using a social constructivist approach for pre-service teachers. Thirty-seven pre-service teachers at the Batu Lintang Teacher Institute, Sarawak, Malaysia were randomly selected to participate in the study. The participants were required to complete the course online without the typical face-to-face classes and they were also required to solve authentic mathematical problems in small groups of 4-5 participants based on the Polya’s Problem Solving Model via asynchronous online discussions. Quantitative and qualitative methods such as questionnaires and interviews were used to evaluate the effects of the online learning course. Findings showed that a majority of the participants were satisfied with their learning experiences in the course. There were no significant changes in the participants’ attitudes toward mathematics, while the participants’ skills in problem solving for “understand the problem” and “devise a plan” steps based on the Polya’s Model were significantly enhanced, though no improvement was apparent for “carry out the plan” and “review”. The results also showed that there were significant improvements in the participants’ critical thinking skills. Furthermore, participants with higher initial computer skills were also found to show higher performance in mathematical problem solving as compared to those with lower computer skills. However, there were no significant differences in the participants’ achievements in the course based on gender. Generally, the online social constructivist mathematical problem solving course is beneficial to the participants and ought to be given the attention it deserves as an alternative to traditional classes. Nonetheless, careful considerations need to be made in the designing and implementing of online courses to minimize problems that participants might encounter while participating in such courses.

The Car Resequencing Problem with Pull-Off Tables

The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.

A Column-Generation Approach for a Short-Term Production Planning Problem in Closed-Loop Supply Chains

We present a new model formulation for a multi-product lot-sizing problem with product returns and remanufacturing subject to a capacity constraint. The given external demand of the products has to be satisfied by remanufactured or newly produced goods. The objective is to determine a feasible production plan, which minimizes production, holding, and setup costs. As the LP relaxation of a model formulation based on the well-known CLSP leads to very poor lower bounds, we propose a column-generation approach to determine tighter bounds. The lower bound obtained by column generation can be easily transferred into a feasible solution by a truncated branch-and-bound approach using CPLEX. The results of an extensive numerical study show the high solution quality of the proposed solution approach.

Exact Solutions to the Symmetric and Asymmetric Vehicle Routing Problem with Simultaneous Delivery and Pick-Up

In reverse logistics networks, products (e.g., bottles or containers) have to be transported from a depot to customer locations and, after use, from customer locations back to the depot. In order to operate economically beneficial, companies prefer a simultaneous delivery and pick-up service. The resulting Vehicle Routing Problem with Simultaneous Delivery and Pick-up (VRPSDP) is an operational problem, which has to be solved daily by many companies. We present two mixed-integer linear model formulations for the VRPSDP, namely a vehicle-flow and a commodity-flow model. In order to strengthen the models, domain-reducing preprocessing techniques, and effective cutting planes are outlined. Symmetric benchmark instances known from the literature as well as new asymmetric instances derived from real-world problems are solved to optimality using CPLEX 12.1.

Development of a novel material flow simulation model for the integration of spatial and process relevant information

Simulation techniques are almost indispensable in the analysis of complex systems. Materials- and related information flow processes in logistics often possess such complexity. Further problem arise as the processes change over time and pose a Big Data problem as well. To cope with these issues adaptive simulations are more and more frequently used. This paper presents a few relevant advanced simulation models and intro-duces a novel model structure, which unifies modelling of geometrical relations and time processes. This way the process structure and their geometric relations can be handled in a well understandable and transparent way. Capabilities and applicability of the model is also presented via a demonstrational example.