基于遗传算法的有柔性路径的动态调度问题研究

建立了有柔性路径的FMS动态调度问题的模型．采用离线重调度的方法，提出一种结合离线重调度两种生成调度方式的方法来阐述FMS的有柔性路径动态调度问题．最后给出了该问题的遗传算法解决方法和计算示例．     

Flow shop scheduling with deteriorating jobs under dominating machines

This paper addresses no-wait or no-idle flow shop scheduling problems with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting time. A simple linear deterioration function is assumed and some dominating relationships between machines can be satisfied. It is shown that for the problems to minimize makespan or weighted sum of completion time, polynomial algorithms still exist, although these problems are more complicated than the classical ones. When the objective is to minimize maximum lateness or maximum tardiness, the solutions of a classical version may not hold.     

Setting tolerance limits for statistical project control using earned value management

Project control has been a research topic since decades that attracts both academics and practitioners. Project control systems indicate the direction of change in preliminary planning variables compared with actual performance. In case their current project performance deviates from the planned performance, a warning is indicated by the system in order to take corrective actions.Earned value management/earned schedule (EVM/ES) systems have played a central role in project control, and provide straightforward key performance metrics that measure the deviations between planned and actual performance in terms of time and cost. In this paper, a new statistical project control procedure sets tolerance limits to improve the discriminative power between progress situations that are either statistically likely or less likely to occur under the project baseline schedule. In this research, the tolerance limits are derived from subjective estimates for the activity durations of the project. Using the existing and commonly known EVM/ES metrics, the resulting project control charts will have an improved ability to trigger actions when variation in a project׳s progress exceeds certain predefined thresholdsA computational experiment has been set up to test the ability of these statistical project control charts to discriminate between variations that are either acceptable or unacceptable in the duration of the individual activities. The computational experiments compare the use of statistical tolerance limits with traditional earned value management thresholds and validate their power to report warning signals when projects tend to deviate significantly from the baseline schedule.     

Rolling horizon master production schedule performance: A policy analysis

In this paper, a simulation experiment has been developed to examine the combined influence of the design, inventory and environmental factors on the cost performance of a rolling horizon master production schedule. Specifically, a 2 5 factorial design was used to examine the effects associated with three rolling schedule design policies, one inventory policy and one environmental condition of forecast error on MPS cost performance. The study was based on actual data from a paint company. Results suggest that the choice of appropriate lot-size and inventory policies have a significant influence on MPS costs and that there are indeed important interactions between these policies and other design factors of a rolling schedule.     

Guest Editorial Production Planning and Control in other Industries

This paper provides an excursion into various scheduling problems arising in the manufacturing environment and possible approaches that can be taken to solve them. It reviews the research in production scheduling from the perspective of designing and operating a production system and examines the research strategies adopted to find the solution of the practical problems. This review is in the form of the paradigms that evolved during the twentieth century and shows the transition in theory and practice of each paradigm. It covers the fundamental frameworks of scheduling theory, outlining various approaches that can be taken to solve (optimally or approximately) such problems, and the difficulties arising in their practical use. Subsequently, an iterative scheduling process is suggested as an extension of existing paradigms to solve practical production scheduling problems and to bridge the gap between theory and practice in production scheduling and control.     

Evaluation of scheduling strategies for a dynamic job shop in a tool-shared,flexible manufacturing environment

A two-phase approach is used to examine the impact of job scheduling rules and tool selection policies for a dynamic job shop system in a tool-shared, flexible manufacturing environment. The first phase develops a generalized simulation model and analyses 'simple' job scheduling rules and tool selection policies under various operating scenarios. The results from this investigation are then used to develop and analyse various bi-criteria rules in the second phase of this study. The results show that the scheduling rules have the most significant impact on system performance, particularly at high shop load levels. Tool selection policies affect some of the performance measures, most notably, proportion of tardy jobs, to a lesser degree. Higher machine utilizations can be obtained at higher tool duplication levels but at the expense of increased tooling costs and lower tool utilization. The results also show that using different processing time distributions may have a significant impact on shop performance.     

Integrating Neural Networks and Semi-Markov Processes for Automated Knowledge Acquisition: An Application to Real-time Scheduling*

Recently, artificial neural networks (ANN) have gained attention as a promising modeling tool for building intelligent systems. A number of applications have been reported in areas varying from pattern recognition to bankruptcy prediction. In this paper, we present a creative methodology that integrates computer simulation, semi-Markov optimization, and ANN techniques for automated knowledge acquisition in real-time scheduling. The integrated approach focuses on the synergy between operations research and ANN in eliciting human knowledge, filtering inconsistent data, and building competent models capable of performing at the expert level. The new approach includes three main components. First, computer simulation is used to collect expert decisions. This step allows expert knowledge to be obtained in a non-intrusive way and minimizes the difficulties involved in interviewing experts, constructing repertory grids, or using other similar structures required for manual knowledge acquisition. The data collected from computer simulation are then optimized using a semi-Markov decision model to remove data redundancies, inconsistencies, and errors. Finally, the optimized data are used to build ANN-based expert systems. The integrated approach is evaluated by comparing it with the human expert and using ANN alone in the domain of real-time scheduling. The results indicate that ANN-based systems perform worse than human experts from whom the data were collected, but the integrated approach outperforms human experts and ANN models alone.     

Integrative Cycle Scheduling Approach for a Capacitated Flexible Assembly System*

This study revisits the traditional single stage, multi-item, capacitated lot-sizing problem (CLSP) with a new integrative focus on problem structuring. Unlike past research, we develop integrative cycle scheduling approaches which simultaneously address lot-sizing, capacity, and sequencing issues. Our purposes are to (1) explore the effect of sequencing on inventory levels, (2) examine the problem of infeasibility in the economic lot scheduling problem (ELSP), and (3) provide a simple methodology of generating low-cost cycle schedules in an environment with discrete shipping, dynamic demands, limited capacity, zero setup cost, and sequence-independent setup times. Our procedures are compared to benchmark cycle scheduling approaches in terms of both inventory cost and computation time under different demand scenarios, using the operating data from a flexible assembly system (FAS) at the Ford Motor Company's Sandusky, Ohio plant.     

Scheduling in a Management Context: Uncertain Processing Times and Non-Regular Performance Measures*

Decision makers often face scheduling problems in which processing times are not known with certainty. Non-regular performance measures, in which both earliness and tardiness are penalized, are also becoming more common in both manufacturing and service operations. We model a managerial environment with task processing times (which include sequenceindependent set-up times) prescribed by three-parameter lognormal distributions. Upon completion, each task derives a reward given by a particular piecewise-linear reward function. The objective is to select a sequence of tasks maximizing the expected total reward. The relative generality of the problem renders many enumerative methods inapplicable or computationally intractable. To overcome such difficulties we develop efficient priorityinduced construction (PIC) heuristics which build up a complete schedule by inserting tasks (singly from a list) into a partial sequence of tasks. In each partial and complete sequence a period of idle time is permitted prior to the first task. Performance on realistic-sized problems is very encouraging, with cost penalties averaging less than one percent.     

Solution Procedures for the Lot-Streaming Problem

Lot streaming is the process of splitting a job into sublots so its operations can be overlapped and its progress accelerated. We present a computationally efficient procedure for solving the m-machine, two-sublot problem, and we discuss the bottleneck insights that emerge from the analysis. We also examine heuristic approaches for more than two sublots and discuss computational results for these procedures.