764 research outputs found
Dynamic adjustment of dispatching rule parameters in flow shops with sequence dependent setup times
Decentralized scheduling with dispatching rules is applied in many fields of production and logistics, especially in highly complex manufacturing systems. Since dispatching rules are restricted to their local information horizon, there is no rule that outperforms other rules across various objectives, scenarios and system conditions. In this paper, we present an approach to dynamically adjust the parameters of a dispatching rule depending on the current system conditions. The influence of different parameter settings of the chosen rule on system performance is estimated by a machine learning method, whose learning data is generated by preliminary simulation runs. Using a dynamic flow shop scenario with sequence dependent setup times, we demonstrate that our approach is capable of significantly reducing the mean tardiness of jobs
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
Using real-time information to reschedule jobs in a flowshop with variable processing times
Versión revisada. Embargo 36 mesesIn a time where detailed, instantaneous and accurate information on shop-floor status is becoming available in many manufacturing companies due to Information Technologies initiatives such as Smart Factory or Industry 4.0, a question arises regarding when and how this data can be used to improve scheduling decisions. While it is acknowledged that a continuous rescheduling based on the updated information may be beneficial as it serves to adapt the schedule to unplanned events, this rather general intuition has not been supported by a thorough experimentation, particularly for multi-stage manufacturing systems where such continuous rescheduling may introduce a high degree of nervousness in the system and deteriorates its performance. In order to study this research problem, in this paper we investigate how real-time information on the completion times of the jobs in a flowshop with variable processing times can be used to reschedule the jobs. In an exhaustive computational experience, we show that rescheduling policies pay off as long as the variability of the processing times is not very high, and only if the initially generated schedule is of good quality. Furthermore, we propose several rescheduling policies to improve the performance of continuous rescheduling while greatly reducing the frequency of rescheduling. One of these policies, based on the concept of critical path of a flowshop, outperforms the rest of policies for a wide range of scenarios.Ministerio de Ciencia e Innovación DPI2016-80750-
Order release in a workload controlled flow-shop with sequence-dependent set-up times
In this paper, we report a simulation study on the role of sequence-dependent
set-up times in decision making at the order release level of a workload controlled
make-to-order flow-shop. The study evaluates the potential for set-ups savings,
dependent on the level of workload in the shop, for two alternative strategies,
namely considering set-up times centrally, within the release decision or locally,
within the dispatching decision. These strategies are compared and assessed on
the basis of two main performance measures namely time in system and standard
deviation of the job lateness. Results indicate that the local strategy, which has
been traditionally adopted in practice and in most of the studies dealing with
sequence-dependent set-up times, does not always give the best results.
The release frequency and the shop workload appear critical to the selection of
the strategy to adopt, strongly influencing system performance.Fundação para a Ciência e a Tecnologia (FCT)Universidade do Minh
Lot Splitting in Stochastic Flow Shop and Job Shop Environments
In recent years many firms have been implementing small lot size production. Lot
splitting breaks large orders into smaller transfer lots and offers the ability to move
parts more quickly through the production process. This paper extends the deterministic
studies by investigating various lot splitting policies in both stochastic job
shop and stochastic flow shop settings using performance measures of mean flow
time and the standard deviation of flow time. Using a computer simulation experiment,
we found that in stochastic dynamic job shops, the number of lot splits is more important
than the exact fonn of splitting. However, when optimal job sizes are determined for
each scenario, we found a few circumstances where the implementation of a small
initial split, called a "flag," can provide measurable improvement in flow time
performance. Interestingly, the vast majority of previous research indicates that
methods other than equal lot splitting typically improves makespan performance.
The earlier research, however, has been set in the static, deterministic flow shop
environment. Thus, our results are of practical interest since they show that the
specific method of lot splitting is important in only a small set of realistic environments
while the choice of an appropriate number of splits is typically more important
Evolutionary methods for the design of dispatching rules for complex and dynamic scheduling problems
Three methods, based on Evolutionary Algorithms (EAs), to support and automate the design
of dispatching rules for complex and dynamic scheduling problems are proposed in this thesis.
The first method employs an EA to search for problem instances on which a given dispatching
rule performs badly. These instances can then be analysed to reveal weaknesses of the
tested rule, thereby providing guidelines for the design of a better rule. The other two methods
are hyper-heuristics, which employ an EA directly to generate effective dispatching rules. In
particular, one hyper-heuristic is based on a specific type of EA, called Genetic Programming
(GP), and generates a single rule from basic job and machine attributes, while the other generates
a set of work centre-specific rules by selecting a (potentially) different rule for each
work centre from a number of existing rules. Each of the three methods is applied to some
complex and dynamic scheduling problem(s), and the resulting dispatching rules are tested
against benchmark rules from the literature. In each case, the benchmark rules are shown to be
outperformed by a rule (set) that results from the application of the respective method, which
demonstrates the effectiveness of the proposed methods
- …