Scheduling (production processes)

Abstract: (1996). Response Surface Methodology. IIE Transactions: Vol. 28, Scheduling and Logistics, pp. 1031-1032.

Abstract: THE CONTEXT AND IMPORTANCE OF INVENTORY MANAGEMENT AND PRODUCTION PLANNING AND SCHEDULING. The Importance of Inventory Management and Production Planning and Scheduling. Strategic Issues. Frameworks for Inventory Management and Production Planning and Scheduling. Forecasting. TRADITIONAL REPLENISHMENT SYSTEMS FOR MANAGING INDIVIDUAL--ITEM INVENTORIES. Order Quantities When Demand is Approximately Level. Lot Sizing for Individual Items with Time--Varying Demand. Individual Items with Probabilistic Demand. SPECIAL CLASSES OF ITEMS. Managing the Most Important (Class A) Inventories. Managing Routine (Class C) Inventories. Style Goods and Perishable Items. THE COMPLEXITIES OF MULTIPLE ITEMS AND MULTIPLE LOCATIONS. Coorinated Replenishments at a Single Stocking Point. Supply Chain Management and Multiechelon Inventories. PRODUCTION PLANNING AND SCHEDULING. An Overall Framework for Production Planning and Scheduling. Medium--Range Aggregate Production Planning. Material Requirements Planning and its Extensions. Just--in--Time and Optimized Production Technology. Short--Range Production Scheduling. Summary. Appendices. Indexes.

Abstract: Current research on gain scheduling is clarifying customary practices as well as devising new approaches and methods for the design of nonlinear control systems.

Abstract: Project scheduling is concerned with single-item or small batch production where scarce resources have to be allocated to dependent activities over time. Applications can be found in diverse industries such as construction engineering, software development, etc. Also, project scheduling is increasingly important for make-to-order companies where the capacities have been cut down in order to meet lean management concepts. Likewise, project scheduling is very attractive for researchers, because the models in this area are rich and, hence, difficult to solve. For instance, the resource-constrained project scheduling problem contains the job shop scheduling problem as a special case. So far, no classification scheme exists which is compatible with what is commonly accepted in machine scheduling. Also, a variety of symbols are used by project scheduling researchers in order to denote one and the same subject. Hence, there is a gap between machine scheduling on the one hand and project scheduling on the other with respect to both, viz. a common notation and a classification scheme. As a matter of fact, in project scheduling, an ever growing number of papers is going to be published and it becomes more and more difficult for the scientific community to keep track of what is really new and relevant. One purpose of our paper is to close this gap. That is, we provide a classification scheme, i.e. a description of the resource environment, the activity characteristics, and the objective function, respectively, which is compatible with machine scheduling and which allows to classify the most important models dealt with so far. Also, we propose a unifying notation. The second purpose of this paper is to review some of the recent developments. More specifically, we review exact and heuristic algorithms for the single-mode and the multi-mode case, for the time–cost tradeoff problem, for problems with minimum and maximum time lags, for problems with other objectives than makespan minimization and, last but not least, for problems with stochastic activity durations.

Abstract: The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by [Allahverdi, A., Gupta, J.N.D., Aldowaisan, T., 1999. A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences 27, 219–239], who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times. It further categorizes the literature according to shop environments, including single-machine, parallel machines, flow shop, no-wait flow shop, flexible flow shop, job shop, open shop, and others.