Dynamic scheduling in a multi-product manufacturing system

To remain competitive in global marketplace, manufacturing companies need to improve their operational practices. One of the methods to increase competitiveness in manufacturing is by implementing proper scheduling system. This is important to enable job orders to be completed on time, minimize waiting time and maximize utilization of equipment and machineries. The dynamics of real manufacturing system are very complex in nature. Schedules developed based on deterministic algorithms are unable to effectively deal with uncertainties in demand and capacity. Significant differences can be found between planned schedules and actual schedule implementation. This study attempted to develop a scheduling system that is able to react quickly and reliably for accommodating changes in product demand and manufacturing capacity. A case study, 6 by 6 job shop scheduling problem was adapted with uncertainty elements added to the data sets. A simulation model was designed and implemented using ARENA simulation package to generate various job shop scheduling scenarios. Their performances were evaluated using scheduling rules, namely, first-in-first-out (FIFO), earliest due date (EDD), and shortest processing time (SPT). An artificial neural network (ANN) model was developed and trained using various scheduling scenarios generated by ARENA simulation. The experimental results suggest that the ANN scheduling model can provided moderately reliable prediction results for limited scenarios when predicting the number completed jobs, maximum flowtime, average machine utilization, and average length of queue. This study has provided better understanding on the effects of changes in demand and capacity on the job shop schedules. Areas for further study includes: (i) Fine tune the proposed ANN scheduling model (ii) Consider more variety of job shop environment (iii) Incorporate an expert system for interpretation of results. The theoretical framework proposed in this study can be used as a basis for further investigation

Group Scheduling in a Cellular Manufacturing Shop to Minimise Total Tardiness and nT: a Comparative Genetic Algorithm and Mathematical Modelling Approach

In this paper, family and job scheduling in a cellular manufacturing shop is addressed where jobs have individual due dates. The objectives are to minimise total tardiness and the number of tardy jobs. Family splitting among cells is allowed but job splitting is not. Two optimisation methods are employed in order to solve this problem, namely mathematical modelling (MM) and genetic algorithm (GA). The results showed that GA found the optimal solution for most of the problems with high frequency. Furthermore, the proposed GA is efficient compared to the MM especially for larger problems in terms of execution times. Other critical aspects of the problem such as family preemption only, impact of family splitting on common due date scenarios and dual objective scenarios are also solved. In short, the proposed comparative approach provides critical insights for the group scheduling problem in a cellular manufacturing shop with distinctive cases

A decomposition-based algorithm for flexible flow shop scheduling with stochastic processing times

Best Student Paper Award of International Conference on Systems Engineering and Engineering Management 2009: Mr. Kai WangSince real manufacturing is dynamic and tends to suffer a wide range of uncertainties, research on production scheduling with uncertainty has received much more attention recently. Although various approaches have been investigated on the scheduling problem with uncertainty, this problem is still difficult to be solved optimally by any single approach, because of its inherent difficulties. This paper considers makespan optimization of a flexible flow shop (FFS) scheduling problem with stochastic processing times. It proposes a novel decomposition-based algorithm (DBA) to decompose an FFS into several clusters which can be solved more easily by different approaches. A neighbouring K-means clustering algorithm is developed to firstly group the machines of an FFS into an appropriate number of clusters, based on weighted cluster validity indices. A back propagation network (BPN) is then adopted to assign either the shortest processing time (SPT) or the genetic algorithm (GA) to generate a sub-schedule for each cluster. If two neighbouring clusters are allocated with the same approach, they are subsequently merged. After machine grouping and approach assignment, an overall schedule is generated by integrating the sub-schedules of the clusters. Computation results reveal that the proposed approach is superior to SPT and GA alone for FFS scheduling with stochastic processing times.postprintThe International Conference on Systems Engineering and Engineering Management 2009 of the World Congress on Engineering and Computer Science (WCECS 2009), San Francisco, CA., 20-22 October 2009. In Proceedings of WCECS, 2009, v. 2, p. 1050-106

Modelling the US Federal Spending Process: Overview and Implications

The object of study is the US Federal budget process - an institutional process of increasing prominence in US and world affairs - which is unique in generating quantitative data for scholarly research. The authors first outline their rigorous, but simple, econometric models of how budget decisions are made, coordinated, and implemented and then trace the implications of their high-inertia view of the process for the US economic cycle. They propound a presidential and Congressional ambition model of current and postwar cyclical economic difficulties, including stagflation, in terms of a macroeconomic model of the US economy in which federal governmental expenditure is endogenous. The chapter concludes with speculation on the disastrous consequences for society of the growth of a sluggishly adaptable bureaucratic process operating in a rapidly changing economic and social environment

A Digital Twin Framework for Production Planning Optimization: Applications for Make-To-Order Manufacturers

In this dissertation, we develop a Digital Twin framework for manufacturing systems and apply it to various production planning and scheduling problems faced by Make-To-Order (MTO) firms. While this framework can be used to digitally represent a particular manufacturing environment with high fidelity, our focus is in using it to generate realistic settings to test production planning and scheduling algorithms in practice. These algorithms have traditionally been tested by either translating a practical situation into the necessary modeling constructs, without discussion of the assumptions and inaccuracies underlying this translation, or by generating random instances of the modeling constructs, without assessing the limitations in accurately representing production environments. The consequence has been a serious gap between theory advancement and industry practice. The major goal of this dissertation is to develop a framework that allows for practical testing, evaluation, and implementation of new approaches for seamless industry adoption. We develop this framework as a modular software package and emphasize the practicality and configurability of the framework, such that minimal modelling effort is required to apply the framework to a multitude of optimization problems and manufacturing systems. Throughout this dissertation, we emphasize the importance of the underlying scheduling problems which provide the basis for additional operational decision making. We focus on the computational evaluation and comparisons of various modeling choices within the developed frameworks, with the objective of identifying models which are both effective and computationally efficient. In Part 1 of this dissertation, we consider a class of Production Planning and Execution problems faced by job shop manufacturing systems. In Part 2 of this dissertation, we consider a class of scheduling problems faced by manufacturers whose production system is dominated by a single operation

Solving Weighted Number of Operation Plus Processing Time Due-Date Assignment, Weighted Scheduling and Process Planning Integration Problem Using Genetic and Simulated Annealing Search Methods

Traditionally, the three important manufacturing functions, which are process planning, scheduling and due-date assignment, are performed separately and sequentially. For couple of decades, hundreds of studies are done on integrated process planning and scheduling problems and numerous researches are performed on scheduling with due date assignment problem, but unfortunately the integration of these three important functions are not adequately addressed. Here, the integration of these three important functions is studied by using genetic, random-genetic hybrid, simulated annealing, random-simulated annealing hybrid and random search techniques. As well, the importance of the integration of these three functions and the power of meta-heuristics and of hybrid heuristics are studied

A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe