Search

Dynamic task scheduling problem in cloud manufacturing (CMfg) is always challenging because of changing manufacturing requirements and services. To make instant decisions for task requirements, deep reinforcement learning-based (DRL-based) methods have been broadly applied to learn the scheduling policies of service providers. However, the current DRL-based scheduling methods struggle to fine-tune a pre-trained policy effectively. The resulting training from scratch takes more time and may easily overfit the environment. Additionally, most DRL-based methods with uneven action distribution and inefficient output masks largely reduce the training efficiency, thus degrading the solution quality. To this end, this paper proposes an improved DRL-based approach for dynamic task scheduling in CMfg. First, the paper uncovers the causes behind the inadequate fine-tuning ability and low training efficiency observed in existing DRL-based scheduling methods. Subsequently, a novel approach is proposed to address these issues by updating the scheduling policy while considering the distribution distance between the pre-training dataset and the in-training policy. Uncertainty weights are introduced to the loss function, and the output mask is extended to the updating procedures. Numerical experiments on thirty actual scheduling instances validate that the solution quality and generalization of the proposed approach surpass other DRL-based methods at most by 32.8% and 28.6%, respectively. Additionally, our method can effectively fine-tune a pre-trained scheduling policy, resulting in an average reward increase of up to 23.8%. [ABSTRACT FROM AUTHOR]

The cloud-edge collaborative manufacturing system (CCMS) connects distributed factories to a cloud centre through cloud-edge collaborative communication, introducing both opportunities and challenges to conventional dynamic job scheduling. Enhancing each factory's scheduling performance by sharing general scheduling knowledge among heterogeneous factories under the consideration of data privacy protection remains challenging. To this end, this paper proposes to solve the dynamic job scheduling in the context of CCMS with a novel federated deep reinforcement learning (FDRL) approach. Within each factory, the scheduling objective involves minimising the makespan and energy consumption, accounting for machine warm-up procedures and real-time dynamics. To handle heterogeneous policy structures, we aggregate their hidden parameters through FDRL, with states, actions, and rewards designed to facilitate the aggregation. The two-phase algorithm, comprising iterative local training and global aggregation, trains the scheduling policies. Constraint items are introduced to the loss functions to smooth local training, and the global aggregation considers production scales and obtained objectives. The proposed approach enhances the solution quality and generalisation of each factory's scheduling policy without exposing original production data. Numerical experiments conducted on sixty scheduling instances validate the superiority of the proposed approach compared to twelve dynamic scheduling methods. Compared to independently trained DRL-based approaches, the proposed FDRL-based approach achieves up to an 8.9% reduction in makespan and a 22.3% decrease in energy consumption through knowledge sharing. [ABSTRACT FROM AUTHOR]

In contemporary manufacturing and supply chain environments, there are various challenges that companies have to face. Many companies are facing challenges to respond quickly to customers' requirements and to provide customised products cost effectively. Mass customisation (MC) can help companies to provide customised products and services quickly at a low price. Integrated decision-making can obtain performance improvement in many situations. This paper investigates the problem of scheduling integration of flexible manufacturing systems (FMSs) for mass customisation. A mathematical model is formulated for the problem. A set-based dynamic algorithm is developed. Numerical studies are made on the proposed algorithm by simulation and by statistical analysis. Conclusions, managerial implications, and future research suggestions are provided. [ABSTRACT FROM AUTHOR]

According to [Dolgui, Alexandre, and Jean Marie Proth. 2010. Supply Chain Engineering: Useful Methods and Techniques. Vol. 539. Springer.], advancing tactical levels in production systems has led to the disappearance of static scheduling in favour of dynamic scheduling. Additionally, the evolving challenges in the supply chain paradigm have significantly impacted the organisation of production systems. This shift has moved scheduling issues from the tactical to the strategic level, resulting in linear organisations encompassing scheduling decisions. [Proth, Jean Marie. 2007. "Scheduling: New Trends in Industrial Environment." Annual Reviews in Control 31 (1): 157–166. .] emphasised that real-time scheduling in production systems has become a pivotal area of research. He presented several open problems for researchers to address in this context, including (1) the development of real-time algorithms capable of handling multiple operations on the same product and unrelated resources, (2) adapting previous schedules with certain modifications, (3) addressing unforeseen actions that arise randomly in real-time planning, and (4) exploring cyclic scheduling problems with size limits as alternative solutions to heuristic approaches. This paper reviews the evolving trends in light of J.M. Proth's predictions and advice within the aforementioned domains. [ABSTRACT FROM AUTHOR]

The recent trend of globalisation of the economy has been accelerated thanks to emerging new communication technologies. This forces some companies to be adapted to rapidly changing market requirements utilising a multi-factory production network. Job scheduling in such a distributed manufacturing system, is significantly complicated especially in the presence of dynamic events. Furthermore, production systems need to be flexible to timely react to the imposed changes. Hence, reconfigurable machine tools (RMTs) can be used as a resource for flexibility in manufacturing systems. This paper deals with a distributed job-shop rescheduling problem, in which the facilities benefit from reconfigurable machines. Firstly, the problem is mathematically formulated to minimise total weighted lateness in a static state. Then, the dynamic version is extent based on a designed conceptual framework of rescheduling module to update the current schedule. Since the problem is NP-hard, a self-adaptive hybrid equilibrium optimiser algorithm is proposed. The experiments show that the proposed EO algorithm is extremely efficient. Finally, a simulation-optimisation model is developed to evaluate the performance of the manufacturing system facing stochastic arriving jobs. The obtained results show that the production system can be very flexible relying on its distributed facilities and reconfigurable machines. [ABSTRACT FROM AUTHOR]

Nowadays, manufacturing systems are seeking control architectures that offer efficient production performance and reactivity to disruptive events. Dynamic hybrid control architectures are a promising approach as they are not only able to switch dynamically between hierarchical, heterarchical and semi-heterarchical structures, they can also switch the level of coupling between predictive scheduling and reactive control techniques. However, few approaches address an efficient switching process in terms of structure and coupling. This paper presents a switching mechanism framework in dynamic hybrid control architectures, which exploits the advantages of hierarchical manufacturing scheduling systems and heterarchical manufacturing execution systems, and also mitigates the respective reactivity and optimality drawbacks. The main feature in this framework is that it monitors the system dynamics online and shifts between different operating modes to attain the most suitable production control strategy. The experiments were carried out in an emulation of a real manufacturing system to illustrate the benefits of including a switching mechanism in simulated scenarios. The results show that the switching mechanism improves response to disruptions in a global performance indicator as it permits to select the best alternative from several operating modes. [ABSTRACT FROM PUBLISHER]

In contemporary manufacturing environments, companies face various challenges in trying to meet customer demand in a timely manner. This paper investigates simultaneous part input sequencing and robot scheduling of flexible manufacturing systems for mass customisation. A mathematical model is formulated for this simultaneous and continuous time-based decision-making problem. A segment set-based approach is proposed to solve the problem. Numerical studies are performed by simulation and statistical analyses to evaluate the approach. The proposed approach is compared to different approaches and analysed under various conditions. Conclusions, managerial implications, and future research suggestions are provided. [ABSTRACT FROM AUTHOR]

Academic scheduling problems usually assume deterministic and known in advance data. However, this situation is not often met in practice, since data may be subject to uncertainty and it may change over time. In this paper, we introduce a general rescheduling framework to address such dynamic scheduling problems. The framework consists mainly of a controller that makes use of a solver. The solver can assume deterministic and static data, whereas the controller deals with the uncertain and dynamic aspects of the problem and it is in charge of triggering the solver when needed and when possible. Extensive tests are carried out for the job shop problem, and we demonstrate that the framework can be used to ascertain the benefit of using rescheduling over static methods, decide between rescheduling policies, and finally we show that it can be applied in real-life applications due to a low time overhead. The framework is general enough to be applied to any scheduling environment where a fast enough deterministic solver exists. [ABSTRACT FROM AUTHOR]

The primary objective of this paper is to compare five rescheduling strategies according to their effectiveness in reducing entropic-related complexity arising from machine breakdowns in manufacturing systems. Entropic-related complexity is the expected amount of information required to describe the state of the system. Previous case studies carried out by the authors have guided computer simulations, which were carried out in Arena 5.0 in combination with MS Excel. Simulation performance is measured by: (1) entropic-related complexity measures, which quantify: (a) the complexity associated with the information content of schedules, and (b) the complexity associated with the variations between schedules; and (2) mean flow time. The results highlight two main points: (a) the importance of reducing unbalanced machine workloads by using the least utilised machine to process the jobs affected by machine breakdowns, and (b) low disruption strategies are effective at reducing entropic-related complexity; this means that applying rescheduling strategies in order to manage complexity can be beneficial up to a point, which, in low disruption strategies, is included in their threshold conditions. The contribution of this paper is two-fold. First, it extends the application of entropic-related complexity to every schedule generated through rescheduling, whereas previous work only applied it to the original schedule. Second, recommendations are proposed to schedulers for improving their rescheduling practice in the face of machine breakdowns. Those recommendations vary according to the manufacturing organisations' product type and scheduling objectives. Further work includes: (a) preparing a detailed workbook to measure entropic-related complexity at shop-floor level; and (b) extending the analysis to other types of disturbances, such as customer changes. [ABSTRACT FROM AUTHOR]

Because semiconductor manufacturing is a complex and dynamic process, production scheduling in this industry typically relies on simple decision policies that use local rather than global information. Such myopic policies may lead to increased congestion in the material handling system and negatively impact throughput. In this paper, we propose a fluid-model lot dispatching policy that iteratively optimises lot selection based on current WIP distribution of the entire system. Furthermore, we propose to split the decision policies into two phases in order to include travel times information into the dispatching and targeting decisions. We provide simulation results for a prototype facility that show that our proposed policies outperform commonly used dispatching rules in throughput, machine utilisation and machine target accuracy. [ABSTRACT FROM AUTHOR]

Aircraft assembly requires a large number of materials from hundreds of suppliers, and the uncertainty in material delivery has a negative impact on the assembly schedule. Existing researches stop short of introducing how to reschedule assembly activities in this context, so this paper addresses a reactive scheduling problem of aircraft moving assembly line with uncertain material delivery, and a bi-objective model is established. To absorb the advantage of machine learning-based method, we present a SVDD-based reactive scheduling method (SVDD-RS). Firstly, the models under different settings of disturbances in material delivery are solved, and the obtained policies are used to train the SVDD classification model in the offline training phase. In the online reactive scheduling phase, the trained SVDD classification model is used to make a preliminary decision for unstarted activities, and exact start-times are further determined by the local forward-looking algorithm. Computational experiments are carried out over practical cases generated from an aircraft assembly line to evaluate the performance of SVDD-RS. The results show that the SVDD classification model can quickly select policies with reasonable accuracy, and SVDD-RS can guarantee a quick response to the disturbance and produce a high-quality solution, compared to other existing reactive scheduling methods. [ABSTRACT FROM AUTHOR]

With the increased awareness of the market competition and protection of the environment, many studies have examined sustainable manufacturing, which combines lean production and sustainable performance, but there still exist barriers between the theories and the practices. This paper proposes a dynamic scheduling unit (DSU) with the multi-agent system (MAS) to build and formulate a kind of sustainable hybrid flow shop in a ubiquitous environment. The processing time, energy consumption and carbon emission are considered the sustainability indicators; and the machine failure, job inserting and job reworking are considered the disruption events. Then, a GA-based dynamic scheduling optimisation with variable priorities is proposed, including a weighted sum of indicators-genetic algorithm (WSI-GA) and an event-driven priority weights local search (EPW-LS) to dynamically generate the prescheduling and rescheduling solutions of the sustainable hybrid flow shop. Lastly, the proposed theories are applied to a computational case of part machining via the discrete event simulation method to demonstrate their validity and feasibility. The results show that the WSI-GA for prescheduling is superior to the referenced traditional priority-based genetic algorithms in the four different production modes and that EPW-LS for rescheduling can effectively improve the solutions of the preschedulings once disruption events occur. [ABSTRACT FROM AUTHOR]

Nowadays, manufacturing control systems can respond more effectively to exigent market requirements and real-time demands. Indeed, they take advantage of changing their structural and behavioural arrangements to tailor the control solution from a diverse set of feasible configurations. However, the challenge of this approach is to determine efficient mechanisms that dynamically optimise the configuration between different architectures. This paper presents a dynamic hybrid control architecture that integrates a switching mechanism to control changes at both structural and behavioural level. The switching mechanism is based on a genetic algorithm and strives to find the most suitable operating mode of the architecture with regard to optimality and reactivity. The proposed approach was tested in a real flexible job shop to demonstrate the applicability and efficiency of including an optimisation algorithm in the switching process of a dynamic hybrid control architecture. [ABSTRACT FROM AUTHOR]

This paper provides an overview of our 10-year research on the application of stochastic and dynamic programming techniques to address health care operational deficiencies in a demand-driven way. We first describe the main operational deficiencies motivating our research in the capacity allocation and scheduling of diagnostic equipment and operating rooms. We then present main findings of extensive field studies to show current practices and key features of the problems under consideration. Applications of stochastic and dynamic programming to these problems are discussed by giving key assumptions, mathematical models, properties of the optimal solution, solution approaches and main numerical findings. The relaxation of the key assumptions is shown to lead to various future research directions that have drawn significant interests of the operations research and industrial engineering communities. We conclude by identifying barriers and potential solutions on the path from theories to applications. [ABSTRACT FROM AUTHOR]

Supply and production uncertainties can affect the scheduling and inventory performance of final production systems. Facing such uncertainties, production managers normally choose to maintain the original production schedule, or follow the first-in-first-out policy. This paper develops a new, dynamic algorithm policy that considers scheduling and inventory problems, by taking advantage of real-time shipping information enabled by today’s advanced technology. Simulation models based on the industrial example of a chemical company and the Taguchi’s method are used to test these three policies under 81 experiments with varying supply and production lead times and uncertainties. Simulation results show that the proposed dynamic algorithm outperforms the other two policies for supply chain cost. Results from Taguchi’s method show that companies should focus their long-term effort on the reduction of supply lead times, which positively affects the mitigation of supply uncertainty. [ABSTRACT FROM PUBLISHER]

In order to increase customer satisfaction and competitiveness, manufacturing systems need to combine flexibility with Just-in-Time (JIT) production. Until now, research on JIT scheduling problems has been mostly limited to high volume assembly lines rather than job-shop-like systems, due to their combinatorial complexity. In this paper, we propose a generic strategy for dynamically controlling task schedules by coupling genetic algorithms and distributed arrival-time control to optimise JIT performance. We explore two such hybrid approaches: a sequential approach where the two algorithms work separately and an integrated approach where the distributed arrival time control is embedded into the genetic algorithm. Performance of these approaches is benchmarked with quadratic linear programme solutions to get a gauge of their relative strengths in a static environment. Results from applying these approaches to a job-shop-like automated cell verify their effectiveness for JIT manufacturing under realistic dynamically changing environment. [ABSTRACT FROM AUTHOR]

Manufacturing systems engineeringwill be greatly affected by advances in technology, including cheaper, ubiquitous sensors, increasing computational speeds, the ability to hold more data and move it faster, and artificial intelligence. This paper discusses the importance of human involvement in the field, especially the role of intuition. The issues examined are the purposes of manufacturing systems engineering; the importance of intuition, and more generally, the role that humans play in the design and operations of manufacturing systems; the effects of new systems-related technologies; how analytical models help the development of intuition; how the use of generic software without intuition can lead to trouble; how intuition is needed to determined what data, and how much of it, is needed for a given purpose. It also describes some successful applications of manufacturing systems research and proposes an organisational structure for manufacturing systems groups. [ABSTRACT FROM AUTHOR]

Much of the research on operations scheduling problems has either ignored setup times or assumed that setup times on each machine are independent of the job sequence. Furthermore, most scheduling problems that have been discussed in the literature are under the assumption that machines are continuously available. Nevertheless, in most real-life industries a machine can be unavailable for many reasons, such as unanticipated breakdowns (stochastic unavailability), or due to scheduled preventive maintenance where the periods of unavailability are known in advance (deterministic unavailability). This paper deals with hybrid flow shop scheduling problems in which there are sequence-dependent setup times (SDSTs), and machines suffer stochastic breakdowns, to optimise objectives based on the expected makespan. With the increase in manufacturing complexity, conventional scheduling techniques for generating a reasonable manufacturing schedule have become ineffective. An immune algorithm (IA) can be used to tackle complex problems and produce a reasonable manufacturing schedule within an acceptable time. In this research, a computational method based on a clonal selection principle and an affinity maturation mechanism of the immune response is used. This paper describes how we can incorporate simulation into an immune algorithm for the scheduling of a SDST hybrid flow shop with machines that suffer stochastic breakdowns. The results obtained are analysed using a Taguchi experimental design. [ABSTRACT FROM AUTHOR]

Affected Operations Rescheduling (AOR) is a process of rescheduling only the operations directly and indirectly affected by a disruption through the propagation of change caused by a disruption while preserving as much as possible the robustness of the initial schedule (preschedule). AOR is basically a centralized heuristic, and thus not readily suitable for project rescheduling in a supply chain where independent and autonomous enterprises do not completely share all the relevant information between each other. This paper is mainly concerned with substantially extending AOR into a distributed version, distAOR, for distributed rescheduling. The primary emphasis of the discussion is placed upon how to deal with the research issues of enterprise autonomy and heterogeneity from the aspects of supply-chain modelling, problem formulation, and solution algorithm. The convergence of the resulting distAOR is theoretically demonstrated. The computational study reported in the first part indicates that the superior efficiency of distAOR is largely due to the fact that only minimum information is shared between enterprises, but at the cost of its lost effectiveness also due to limited information sharing. [ABSTRACT FROM AUTHOR]

In the steelmaking-continuous casting (SCC) production process, machine breakdown is one of the most common disturbances which may make the current schedule unrealisable. Existing rescheduling models for machine breakdown only employ one constraint that charges cannot be processed on this machine in its failure period. However, this method is effective for steelmaking furnace breakdown and refining furnace breakdown but invalid for continuous caster breakdown. Due to the production characteristics of continuous caster, reallocating a casting order and a continuous caster for each unfinished charge on the broken down continuous caster is necessary before making a new schedule. Different reallocation strategies have different impacts on charge’s processing time and processing stage route in the dynamic scheduling process. Therefore, SCC dynamic scheduling for the continuous caster breakdown is different from the other machines. In this paper, the impacts of these strategies are studied, and a dynamic scheduling model which can be used to generate a new schedule for each strategy is built. To obtain a high-quality solution in acceptable computational time for this model with NP-hard feature, a hybrid algorithm featuring a genetic algorithm combined with a general variable neighbourhood search is developed based on the problem-specific characteristics. Computational experiments on practical production data show that the proposed rescheduling method is effective for SCC dynamic scheduling with continuous caster breakdown. [ABSTRACT FROM PUBLISHER]

The heat-treatment operation in dynamic mould manufacturing often involves non-identical jobs, which allow for simultaneous processing yet with different weights and due dates. Effective production control of this operation is essential to improve the on-time delivery and decrease the manufacturing cost of the mould. This paper considers the dynamic control of a batch processor for dealing with such non-identical jobs. A new look-ahead batching strategy called MLAB (mould: look-ahead batching) has been proposed. In MLAB, the control decisions are made by the joint use of both near-future arrival information of upstream operations and workload level information of downstream operations. MLAB strategy is used to control two kinds of conflicting objectives related to the delivery and utilisation performances and finally achieve trade-off based on compromise programming method. Computational experiments are conducted to verify the effectiveness of the MLAB strategy and show that the results are promising as compared to benchmark control strategies. [ABSTRACT FROM PUBLISHER]

This paper studies the performance of static and dynamic scheduling approaches in vehicle-based internal transport (VBIT) systems and is one of the first to systematically investigate under which circumstances, which scheduling method helps in improving performance. In practice, usually myopic dispatching heuristics are used, often using look-ahead information. We argue more advanced scheduling methods can help, depending on circumstances. We introduce three basic scheduling approaches (insertion, combined and column generation) for the static problem. We then extend these to a dynamic, real-time setting with rolling horizons. We propose two further real-time scheduling approaches: dynamic assignment with and without look-ahead. The performances of the above five scheduling approaches are compared with two of the best performing look-ahead dispatching rules known from the literature. The performance of the various approaches depends on the facility layout and work distribution. However, column generation, the combined heuristic, and the assignment approach with look-ahead consistently outperform dispatching rules. Column generation can require substantial calculation time but delivers very good performance if sufficient look-ahead information is available. For large scale systems, the combined heuristic and the dynamic assignment approach with look ahead are recommended and have acceptable calculation times. [ABSTRACT FROM AUTHOR]

The current paper considers dynamic production scheduling for manufacturing systems producing products with deep and complex product structures and complicated process routings. It is assumed that manufacturing and assembly processing times are deterministic. Dynamic scheduling problems may be either incremental (where the schedule for incoming orders does not affect the schedule for existing orders) or regenerative (where a new schedule is produced for both new and existing orders). In both situations, a common objective is to minimize total costs (the sum of work-in-progress holding costs, product earliness and tardiness costs). In this research, heuristic and evolutionary-strategy-based methods have been developed to solve incremental and regenerative scheduling problems. Case studies using industrial data from a company that produces complex products in low volume demonstrate the effectiveness of the methods. Evolution strategy (ES) provides better results than the heuristic method, but this is at the expense of significantly longer computation times. It was found that performing regenerative planning is better than incremental planning when there is high interaction between the new orders and the existing orders. [ABSTRACT FROM AUTHOR]

To enhance the agility of virtual production systems (VPSs) under today's dynamic and changing manufacturing environment, a self-adaptive dynamic scheduling method based on event-driven is proposed for VPSs in this paper. This method is composed of the mechanisms and algorithm of self-adaptive dynamic scheduling. In the mechanisms, the dynamic events faced by VPSs are determined through users' inputs or supervisory controllers' detections, the local effects made on the schedule are analysed according to the dynamic events, and the self-adaptive measures and rules are specified correspondingly. To implement the dynamic scheduling of VPSs under the guidance of self-adaptive rules, a modified heuristic rescheduling algorithm is proposed for affected operations. A case study illustrates that the proposed method can well accomplish the dynamic scheduling of VPSs in a self-adaptive manner. [ABSTRACT FROM AUTHOR]

In Supply chain (SC) environments, schedules inevitably experience various unexpected disruptions. In these cases, rescheduling is essential to minimise the negative impact on the performance of the system. In this study, a hybrid rescheduling technique is developed for solving coordinated manufacturing tasks scheduling problems with due date changes and machine breakdowns. According to the dynamic features of this problem, a strategy combined with event and periodic driven methods is proposed to improve the stability and robustness of manufacturing performance in a coordinated SC. Moreover, an application case is introduced to test and evaluate the effect of different initialisations in two types of disruption scenarios. The experimental results show that the proposed rescheduling technique has good effectiveness and efficiency in the coordinated manufacturing environment. [ABSTRACT FROM AUTHOR]

The ability to handle unpredictable dynamic events is becoming more important in pursuing agile and flexible production scheduling. At the same time, the cyber-physical convergence in production system creates massive amounts of industrial data that needs to be mined and analysed in real-time. To facilitate such real-time control, this research proposes a hierarchical and distributed architecture to solve the dynamic flexible job shop scheduling problem. Double Deep Q-Network algorithm is used to train the scheduling agents, to capture the relationship between production information and scheduling objectives, and make real-time scheduling decisions for a flexible job shop with constant job arrivals. Specialised state and action representations are proposed to handle the variable specification of the problem in dynamic scheduling. Additionally, a surrogate reward-shaping technique to improve learning efficiency and scheduling effectiveness is developed. A simulation study is carried out to validate the performance of the proposed approach under different scenarios. Numerical results show that not only does the proposed approach deliver superior performance as compared to existing scheduling strategies, its advantages persist even if the manufacturing system configuration changes. [ABSTRACT FROM AUTHOR]

We study the scheduling of production in a multi-item, failure-prone machine with setup times, with the objective of minimising long-run average inventory and backlog costs. We make two contributions to this problem, which has received significantly less attention compared to the standard stochastic economic lot scheduling problem (with random demand and production times). First, we adapt and implement a variety of existing scheduling policies and compare their performance through a set of numerical experiments spanning a wide range of operating conditions. This analysis allows us to identify important shortcomings of the policies, including their poor performance when items have widely different priorities (as dictated by the product of their cost and production rate parameters). Second, we leverage these insights to develop and analyse a new, easy-to-implement policy. This policy tightly controls the surplus of the highest-priority items using fixed base-stock levels and, for all other items, it determines their run lengths dynamically in such a way that long production runs become decreasingly likely with decreasing item priority. Our experiments show that our new policy greatly outperforms the benchmarking policies over a large and important set of operating regimes, comprising high-utilisation systems where the machine cycles through all items at a frequency comparable to or greater than the frequency of failure events. [ABSTRACT FROM AUTHOR]

Smart Manufacturing and Industry 4.0 production environments integrate the physical and decisional aspects of manufacturing processes into autonomous and decentralised systems. One of the main aspects in these systems is production planning, in particular scheduling operations on machines. We introduce here a new decision-making schema, Smart Scheduling, intended to yield flexible and efficient production schedules on the fly, taking advantage of the features of these new environments. The ability to face unforeseen and disruptive events is one of the main improvements in our proposed schema, which uses an efficient screening procedure (Tolerance Scheduling) to lessen the need of rescheduling in the face of those events. [ABSTRACT FROM AUTHOR]

The permutation flowshop scheduling problem has been widely studied under static environment by assuming machines and jobs are available at the time of zero. However, in reality, new orders arrive at production systems randomly, which leads to sheer complexity in scheduling due to the dynamic changes given various constraints of resources. Previous studies simply attach new orders directly after the existing schedule. Recent study shows mixing jobs of old and new orders could result in better scheduling solutions. But the heuristic algorithms are still lacking to implement the job mixing policy. To address this problem, a novel scheduling strategy is herein proposed by integrating match-up strategy and real-time strategy (MR) in order to make use of the remaining time before the old order due date. Based on the new MR strategy, eleven new heuristics are introduced with ten existing and one new priority rules. Computational results illustrate the effectiveness of the new heuristics. A digital tool is developed for ease of application of these heuristics, and it is validated by case studies. [ABSTRACT FROM PUBLISHER]

In real-world manufacturing, disruptions are often encountered during the execution of a predetermined schedule, leading to the degradation of its optimality and feasibility. This study presents a hybrid approach for flexible job-shop scheduling/rescheduling problems under dynamic environment. The approach, coined as ‘HMA’ is a combination of multi-agent system (MAS) negotiation and ant colony optimisation (ACO). A fully distributed MAS structure has been constructed to support the solution-finding process by negotiation among the agents. The features of ACO are introduced into the negotiation mechanism in order to improve the performance of the schedule. Experimental studies have been carried out to evaluate the performance of the approach for scheduling and rescheduling under different types of disruptions. Different rescheduling policies are compared and discussed. The results have shown that the proposed approach is a competitive method for flexible job-shop scheduling/rescheduling for both schedule optimality and computation efficiency. [ABSTRACT FROM PUBLISHER]

Empty wagon redistribution, train formation, routing and scheduling are complex problems for large railways, many of which currently have or are planning dedicated freight railway corridors (DFC). DFC operations due to their unique characteristics require research and new models for better operations planning. The rolling-stock, being expensive assets, need to be utilised in an optimal manner while meeting service quality levels. Motivated by Indian DFC, we present an integer programming formulation of the dynamic problem of empty distribution and train scheduling in DFC and discuss associated modelling issues. By unifying the separate problems into a single and dynamic model, we have developed a framework for more effective rolling stock utilisation. Based on this optimization model, an interactive decision support system is proposed for better decision-making on rolling-stock allocation and train scheduling. Extensive experiments and systematic analyses for a case of Indian DFC highlight the potentialities and effectiveness of the proposed DSS for DFC operations planning and management. [ABSTRACT FROM PUBLISHER]

This study deals with controlling flexible manufacturing systems (FMS) operating in volatile production environments. Most studies that address this issue use some sort of adaptive scheduling that enables the FMS to cope with the randomness and variability efficiently. The methods presented in the literature are usually based on heuristics and use simple dispatching rules. They do not consider changing the decision criteria dynamically as the system conditions change. In contrast to previous studies, the present study focuses on developing a control mechanism for dynamic scheduling that is based on incremental optimisation. This means that each time a scheduling decision is made, the local optimisation problem is solved such that the next jobs to be processed on machines are selected. The objective function (dominant decision criterion) for this optimisation problem is selected dynamically based on production order requirements, actual shop-floor status and system priorities. The proposed multi-criteria optimisation-based dynamic scheduling methodology was evaluated and compared with some known scheduling rules/policies. The results obtained demonstrate the superiority of the suggested methodology as well as its capability to cope with a multi-criteria environment. [ABSTRACT FROM PUBLISHER]

Scheduling block assembly in shipyard production poses great difficulties regarding the accurate prediction of the required spatial resource and effective production control for achieving managerial objectives due to the dynamic spatial layout and the stochastic nature of the production system. In this study, this dynamic space-constrained problem is viewed as two sequential decisions, namely rule-based dispatching and a static spatial configuration. A novel hybrid planning method is developed to employ discrete-event simulation as look-ahead scheduling to evaluate the system performance under various control policies. To rationalise block placement and improve long-term area utilisation, a discrete spatial optimisation problem is formulated and solved using an enumeration-based search algorithm, followed by the application of a series of heuristic positioning strategies. By imitation of the dynamic dispatching and spatial operation, a statistical analysis of the resultant performance can be conducted to select the best-performing priority rules. A case study with an experimental investigation is performed for a local shipyard to demonstrate the applicability of the proposed method. [ABSTRACT FROM PUBLISHER]

Scheduling in a dynamic flowshop that receives jobs at random and unforeseen points in time has traditionally been done by using dispatching rules. This study compares the performances of leading dispatching rules with a cooperative dispatching approach, for the objective of minimising mean flowtime in a flowshop, in which the buffers that hold in-process jobs between machines have finite capacities. Cooperative dispatching employs a consultative and consensus-seeking methodology for deciding which job to dispatch next on a machine. Computational experiments using randomly generated test problems for three different utilisation (congestion) levels are carried out for 5- and 10-machine flowshops, under a wide range of buffer capacities. The results highlight the sensitivity of some of the popular dispatching rules to buffer size. In contrast, cooperative dispatching emerges as a robust method that performs consistently well across the range of buffer sizes and machine utilisations tested. The reductions in mean flowtime obtained by cooperative dispatching, in comparison to the other dispatching rules, are particularly large in flowshops that operate with very tight buffer capacities and elevated levels of congestion [ABSTRACT FROM AUTHOR]

A new scheduling system for selecting dispatching rules in real time is developed by combining the techniques of simulation, data mining, and statistical process control charts. The proposed scheduling system extracts knowledge from data coming from the manufacturing environment by constructing a decision tree, and selects a dispatching rule from the tree for each scheduling period. In addition, the system utilises the process control charts to monitor the performance of the decision tree and dynamically updates this decision tree whenever the manufacturing conditions change. This gives the proposed system the ability to adapt itself to changes in the manufacturing environment and improve the quality of its decisions. We implement the proposed system on a job shop problem, with the objective of minimising average tardiness, to evaluate its performance. Simulation results indicate that the performance of the proposed system is considerably better than other simulation-based single-pass and multi-pass scheduling algorithms available in the literature. We also illustrate knowledge extraction by presenting a sample decision tree from our experiments. [ABSTRACT FROM AUTHOR]

This research examines the production control problem in two-station tandem queueing systems under time constraints. In these two-station tandem queueing systems, jobs must first be processed at the upstream station and then the downstream station. For each job, the sum of the waiting and processing time in the downstream queue is limited by an upper bound. This time constraint is called the process queue time constraint. When the process queue time constraint is violated, a significant scrap cost will be accrued. In this research, we develop a Markov decision model to study the production control problem under process queue time constraints. The objective is to minimise the sum of the expected long-run average inventory holding costs and scrap costs. According to the Markov decision model, an interesting exhaustive structure of the optimal production control policy is found. Based on this exhaustive structure, an efficient algorithm is developed to solve the production control problem numerically. The performance of the proposed algorithm is verified by a simulation study. Compared with other heuristics in the literature, the proposed algorithm can significantly reduce production costs while improving system throughput and utilisation. [ABSTRACT FROM AUTHOR]