Browse
Keywords
Records with Keyword: Scheduling
26. LAPSE:2023.10381
A Systematic Literature Review on Data-Driven Residential and Industrial Energy Management Systems
February 27, 2023 (v1)
Subject: Planning & Scheduling
Keywords: Artificial Intelligence, demand response, energy management, Optimization, Renewable and Sustainable Energy, Scheduling, systematic literature review
The energy transition and the resulting expansion of renewable energy resources increasingly pose a challenge to the energy system due to their volatile and intermittent nature. In this context, energy management systems are central as they coordinate energy flows and optimize them toward economic, technical, ecological, and social objectives. While numerous scientific publications study the infrastructure, optimization, and implementation of residential energy management systems, only little research exists on industrial energy management systems. However, results are not easily transferable due to differences in complexity, dependency, and load curves. Therefore, we present a systematic literature review on state-of-the-art research for residential and industrial energy management systems to identify trends, challenges, and future research directions. More specifically, we analyze the energy system infrastructure, discuss data-driven monitoring and analysis, and review the decision-m... [more]
27. LAPSE:2023.8321
Optimal Energy Consumption Scheduler Considering Real-Time Pricing Scheme for Energy Optimization in Smart Microgrid
February 24, 2023 (v1)
Subject: Planning & Scheduling
Keywords: demand response, energy management, Scheduling, smart grid
Energy consumption schedulers have been widely adopted for energy management in smart microgrids. Energy management aims to alleviate energy expenses and peak-to-average ratio (PAR) without compromising user comfort. This work proposes an energy consumption scheduler using heuristic optimization algorithms: Binary Particle Swarm Optimization (BPSO), Wind Driven Optimization (WDO), Genetic Algorithm (GA), Differential Evolution (DE), and Enhanced DE (EDE). The energy consumption scheduler based on these algorithms under a price-based demand response program creates a schedule of home appliances. Based on the energy consumption behavior, appliances within the home are classified as interruptible, noninterruptible, and hybrid loads, considered as scenario-I, scenario-II, and scenario-III, respectively. The developed model based on optimization algorithms is the more appropriate solution to achieve the desired objectives. Simulation results show that the expense and PAR of schedule power u... [more]
28. LAPSE:2023.7326
Flexible Loads Scheduling Algorithms for Renewable Energy Communities
February 24, 2023 (v1)
Subject: Planning & Scheduling
Renewable Energy Communities (RECs) are emerging as an effective concept and model to empower the active participation of citizens in the energy transition, not only as energy consumers but also as promoters of environmentally friendly energy generation solutions, particularly through the use of photovoltaic panels. This paper aims to contribute to the management and optimization of individual and community Distributed Energy Resources (DER). The solution follows a price and source-based REC management program, in which consumers’ day-ahead flexible loads (Flex Offers) are shifted according to electricity generation availability, prices, and personal preferences, to balance the grid and incentivize user participation. The heuristic approach used in the proposed algorithms allows for the optimization of energy resources in a distributed edge-and-fog approach with a low computational overhead. The simulations performed using real-world energy consumption and flexibility data of a REC wit... [more]
29. LAPSE:2023.7055
Electric Vehicle Charging Modes, Technologies and Applications of Smart Charging
February 24, 2023 (v1)
Subject: Planning & Scheduling
Keywords: charging techniques, charging technologies, key technologies, modes of charging, Scheduling
The rise of the intelligent, local charging facilitation and environmentally friendly aspects of electric vehicles (EVs) has grabbed the attention of many end-users. However, there are still numerous challenges faced by researchers trying to put EVs into competition with internal combustion engine vehicles (ICEVs). The major challenge in EVs is quick recharging and the selection of an optimal charging station. In this paper, we present the most recent research on EV charging management systems and their role in smart cities. EV charging can be done either in parking mode or on-the-move mode. This review work is novel due to many factors, such as that it focuses on discussing centralized and distributed charging management techniques supported by a communication framework for the selection of an appropriate charging station (CS). Similarly, the selection of CS is evaluated on the basis of battery charging as well as battery swapping services. This review also covered plug-in charging te... [more]
30. LAPSE:2023.6723
A Quantum Approach to the Problem of Charging Electric Cars on a Motorway
February 24, 2023 (v1)
Subject: Planning & Scheduling
Keywords: battery charging, electric motor vehicle, Energy, parallel unrelated machines, power, quantum annealing, quantum approximate optimization algorithm, quantum computing, Scheduling
In this paper, the problem of charging electric motor vehicles on a motorway is considered. Charging points are located alongside the motorway. It is assumed that there are a number of vehicles on a given section of a motorway. In the motorway, there are several nodes, and for each vehicle, the entering and the leaving nodes are known, as well as the time of entrance. For each vehicle, we know the total capacity of its battery, and the current amount of energy in the battery when entering the motorway. It is also assumed that for each vehicle, there is a finite set of speeds it can use when traveling the motorway. The speed is chosen when entering the motorway, and cannot be changed before reaching the charging station. For each speed, there is given a corresponding power usage; the higher the speed, the larger the power usage. Each vehicle can only use one charger, and when its battery is full, the amount of energy is sufficient for reaching the outgoing node. We look for a feasible s... [more]
31. LAPSE:2023.6480
Optimal Scheduling of Battery-Swapping Station Loads for Capacity Enhancement of a Distribution System
February 23, 2023 (v1)
Subject: Planning & Scheduling
Keywords: battery-swapping station, mathematical model, Optimization, Scheduling
A battery-swapping station (BSS) can serve as a flexible source in distribution systems, since electric vehicle (EV) batteries can be charged at different time periods prior to their swapping at a BSS. This paper presents an EV battery service transformation from charging to swapping batteries for EVs for the capacity enhancement of a distribution system. A novel mathematical model is proposed to optimally quantify and maximize the flexibility of BSS loads in providing demand response for the utility operator while considering technical operations in the distribution grid. Case studies and numerical findings that consider data from the National Household Travel Survey and a 32-bus distribution system are reported and discussed to demonstrate the effectiveness of the proposed model. Offering battery-swapping services helps reduce not only the peak load, but also the station operation cost.
32. LAPSE:2023.6048
Modified Harmony Search Algorithm for Resource-Constrained Parallel Machine Scheduling Problem with Release Dates and Sequence-Dependent Setup Times
February 23, 2023 (v1)
Subject: Planning & Scheduling
Keywords: harmony search, parallel machines, renewable resources, Scheduling
This research focuses on the problem of scheduling a set of jobs on unrelated parallel machines subject to release dates, sequence-dependent setup times, and additional renewable resource constraints. The objective is to minimize the maximum completion time (makespan). To optimize the problem, a modified harmony search (MHS) algorithm was proposed. The parameters of MHS are regulated using full factorial analysis. The MHS algorithm is examined, evaluated, and compared to the best methods known in the literature. Four algorithms were represented from similar works in the literature. A benchmark instance has been established to test the sensitivity and behavior of the problem parameters of the different algorithms. The computational results of the MHS algorithm were compared with those of other metaheuristics. The competitive performance of the developed algorithm is verified, and it was shown to provide a 42% better solution than the others.
33. LAPSE:2023.5632
Dynamic Mixed Model Lotsizing and Scheduling for Flexible Machining Lines Using a Constructive Heuristic
February 23, 2023 (v1)
Subject: Planning & Scheduling
Keywords: constructive heuristic, dynamic lotsizing, flexible production lines, planning horizon, Scheduling
Dynamic lotsizing and scheduling on multiple lines to meet the customer due dates is significant in multi-line production environments. Therefore, this study investigates dynamic lotsizing and scheduling problems in multiple flexible machining lines considering mixed products. In addition, uncertainty in demand and machine failure is considered. A mathematical model is proposed for the considered problem with an aim to maximize the probability of completion of product models from different customer orders. A constructive heuristic method (CHLP) is proposed to solve the current problem. The proposed heuristic involves the steps to distribute different customer order demands among multiple lines and schedule them considering balancing of makespan between the lines. The performance of CHLP is measured with famous heuristics from the literature, based on the test problem instances. Results indicate that CHLP gives better results in terms of quality of results as compared to other famous li... [more]
34. LAPSE:2023.4774
Cost Optimal Production-Scheduling Model Based on VNS-NSGA-II Hybrid Algorithm—Study on Tissue Paper Mill
February 23, 2023 (v1)
Subject: Planning & Scheduling
Keywords: agile manufacturing, flexible flow-shop, multi-objective optimization, NSGA-II, Scheduling
With the development of the customization concept, small-batch and multi-variety production will become one of the major production modes, especially for fast-moving consumer goods. However, this production mode has two issues: high production cost and the long manufacturing period. To address these issues, this study proposes a multi-objective optimization model for the flexible flow-shop to optimize the production scheduling, which would maximize the production efficiency by minimizing the production cost and makespan. The model is designed based on hybrid algorithms, which combine a fast non-dominated genetic algorithm (NSGA-II) and a variable neighborhood search algorithm (VNS). In this model, NSGA-II is the major algorithm to calculate the optimal solutions. VNS is to improve the quality of the solution obtained by NSGA-II. The model is verified by an example of a real-world typical FFS, a tissue papermaking mill. The results show that the scheduling model can reduce production co... [more]
35. LAPSE:2023.4773
Scheduling Large-Size Identical Parallel Machines with Single Server Using a Novel Heuristic-Guided Genetic Algorithm (DAS/GA) Approach
February 23, 2023 (v1)
Subject: Planning & Scheduling
Keywords: apparent tardiness cost rule, Genetic Algorithm, heuristic, identical parallel machines, Optimization, Scheduling
Parallel Machine Scheduling (PMS) is a well-known problem in modern manufacturing. It is an optimization problem aiming to schedule n jobs using m machines while fulfilling certain practical requirements, such as total tardiness. Traditional approaches, e.g., mix integer programming and Genetic Algorithm (GA), usually fail, particularly in large-size PMS problems, due to computational time and/or memory burden and the large searching space required, respectively. This work aims to overcome such challenges by proposing a heuristic-based GA (DAS/GA). Specifically, a large-scale PMS problem with n independent jobs and m identical machines with a single server is studied. Individual heuristic algorithms (DAS) and GA are used as benchmarks to verify the performance of the proposed combined DAS/GA on 18 benchmark problems established to cover small, medium, and large PMS problems concerning standard performance metrics from the literature and a new metric proposed in this work (standardized... [more]
36. LAPSE:2023.4483
Optimal Scheduling of the Peirce-Smith Converter in the Copper Smelting Process
February 23, 2023 (v1)
Subject: Planning & Scheduling
Keywords: copper losses, copper smelting, linear programming, Optimization, Peirce-Smith converter, Scheduling
Copper losses during the Peirce-Smith converter (PSC) operation is of great concern in the copper smelting process. Two primary objectives of the PSC are to produce blister copper with a shorter batch time and to keep the copper losses at a minimum level. Due to the nature of the process, those two objectives are contradictory to each other. Moreover, actions inside the PSC are subject to several operational constraints that make it difficult to develop a scheduling framework for its optimal operation. In this work, a basic but efficient linear multi-period scheduling framework for the PSC is presented that finds the optimal timings of the PSC operations to keep the copper losses and the batch time at a minimum level. An industrial case study is used to illustrate the effectiveness of the proposed framework. This novel solution can be implemented in other smelting processes and used for the design of an inter-PSC scheduling framework.
37. LAPSE:2023.3186
Scheduling by NSGA-II: Review and Bibliometric Analysis
February 22, 2023 (v1)
Subject: Planning & Scheduling
Keywords: multi-objective optimization, NSGA-II, review, Scheduling, scientometric analysis
NSGA-II is an evolutionary multi-objective optimization algorithm that has been applied to a wide variety of search and optimization problems since its publication in 2000. This study presents a review and bibliometric analysis of numerous NSGA-II adaptations in addressing scheduling problems. This paper is divided into two parts. The first part discusses the main ideas of scheduling and different evolutionary computation methods for scheduling and provides a review of different scheduling problems, such as production and personnel scheduling. Moreover, a brief comparison of different evolutionary multi-objective optimization algorithms is provided, followed by a summary of state-of-the-art works on the application of NSGA-II in scheduling. The next part presents a detailed bibliometric analysis focusing on NSGA-II for scheduling applications obtained from the Scopus and Web of Science (WoS) databases based on keyword and network analyses that were conducted to identify the most intere... [more]
38. LAPSE:2023.2304
Design, Implementation and Simulation of a Small-Scale Biorefinery Model
February 21, 2023 (v1)
Subject: Planning & Scheduling
Second-generation biomass is an underexploited resource, which can lead to valuable products in a circular economy. Available locally as food waste, gardening and pruning waste or agricultural waste, second-generation biomass can be processed into high-valued products through a flexi-feed small-scale biorefinery. The flexi-feed and the use of local biomass ensure the continuous availability of feedstock at low logistic costs. However, the viability and sustainability of the biorefinery must be ensured by the design and optimal operation. While the design depends on the available feedstock and the desired products, the optimisation requires the availability of a mathematical model of the biorefinery. This paper details the design and modelling of a small-scale biorefinery in view of its optimisation at a later stage. The proposed biorefinery comprises the following processes: steam refining, anaerobic digestion, ammonia stripping and composting. The models’ integration and the overall b... [more]
39. LAPSE:2023.2265
Optimal Demand-Side Management Using Flat Pricing Scheme in Smart Grid
February 21, 2023 (v1)
Subject: Planning & Scheduling
Keywords: artificial neural network, Batteries, energy forecasting, energy management, EVs, microgrid generation, Scheduling
This work proposes a framework to solve demand-side management (DSM) problem by systematically scheduling energy consumption using flat pricing scheme (FPS) in smart grid (SG). The framework includes microgrid with renewable energy sources (solar and wind), energy storage systems, electric vehicles (EVs), and building appliances like time flexible, power flexible, and base/critical appliances. For the proposed framework, we develop an ant colony optimization (ACO) algorithm, which efficiently schedules smart appliances, and EVs batteries charging/discharging with microgrid and without (W/O) microgrid under FPS to minimize energy cost, carbon emission, and peak to average ratio (PAR). An integrated technique of enhanced differential evolution (EDE) algorithm and artificial neural network (ANN) is devised to predict solar irradiance and wind speed for accurate microgrid energy estimation. To endorse the applicability of the proposed framework, simulations are conducted. Moreover, the pro... [more]
40. LAPSE:2023.2226
Research on Multi-Equipment Collaborative Scheduling Algorithm under Composite Constraints
February 21, 2023 (v1)
Subject: Planning & Scheduling
Keywords: collaborative operation, compound constraints, hybrid algorithm, multi-equipment, Scheduling
Multi-equipment multi-process frequent scheduling under complex constraints is at the root of a large number of idle time fragments and transport waiting time in multi-equipment processes. To improve equipment utilization and reduce idle transportation time, a production process optimization scheduling algorithm with “minimum processing time and minimum transportation time” is proposed. Taking into account factors such as product priority, equipment priority, process priority, and overall task adjustment, the scheduling optimization is carried out through a hybrid algorithm combining a one-dimensional search algorithm and a dual NSGA-II algorithm. Compared with other algorithms, the scheduling algorithm proposed in this article not only shortens the minimum processing time but also strives to maximize the utilization rate of each piece of equipment, reducing the processing time of the enterprise by 8% or more, while also reducing the overall transportation time and indirectly reducing... [more]
41. LAPSE:2023.1606
Modeling and Optimization of Assembly Line Balancing Type 2 and E (SLBP-2E) for a Reconfigurable Manufacturing System
February 21, 2023 (v1)
Subject: Planning & Scheduling
Keywords: heuristic, line balancing, multi-objective, Optimization, reconfigurable manufacturing system, Scheduling
This study undertakes the line balancing problem while allocating reconfigurable machines to different workstations. A multi-objective model is used to analyze the position of workstations, assignment of configurations to workstations, and operation scheduling in a reconfigurable manufacturing environment. A model is presented that comprises the objectives of the Total Time (TT), the Line Efficiency Index (LEI), and the Customer Satisfaction Index (CSI). The objective is to minimize the completion time and maximize the efficiency of a production line. The proposed model combines the Simple Line Balancing Problems Type 2 and Type E in the form of SLBP-2E. The presented problems are addressed by using a heuristic solution approach due to non-polynomial hard formulation. The heuristic approach is designed to assess different solutions based on no repositioning, separate repositioning of workstations and configuration, and simultaneous repositioning of workstations and configurations. A de... [more]
42. LAPSE:2023.0822
An Improved Arc Flow Model with Enhanced Bounds for Minimizing the Makespan in Identical Parallel Machine Scheduling
February 21, 2023 (v1)
Subject: Planning & Scheduling
Keywords: identical parallel machines, improved arc flow, integer programming, Scheduling, variable neighborhood search
In this paper, an identical parallel machine problem was considered with the objective of minimizing the makespan. This problem is NP-hard in the strong sense. A mathematical formulation based on an improved arc flow model with enhanced bounds was proposed. A variable neighborhood search algorithm was proposed to obtain an upper bound. Three lower bounds from the literature were utilized in the improved arc flow model to improve the efficiency of the mathematical formulation. In addition, a graph compression technique was proposed to reduce the size of the graph. As a consequence, the improved arc flow model was compared with an arc flow model from the literature. The computational results on benchmark instances showed that the improved arc flow model outperformed the literature arc flow model at finding optimal solutions for 99.97% of the benchmark instances, with the overall percentage of the reduction in time reaching 87%.
43. LAPSE:2021.0805
Optimal Cleaning Cycle Scheduling under Uncertain Conditions: A Flexibility Analysis on Heat Exchanger Fouling
December 6, 2021 (v1)
Subject: Planning & Scheduling
Keywords: flexibility, fouling, heat exchanger, maintenance, Scheduling
Fouling is a substantial economic, energy, and safety issue for all the process industry applications, heat transfer units in particular. Although this phenomenon can be mitigated, it cannot be avoided and proper cleaning cycle scheduling is the best way to deal with it. After thorough literature research about the most reliable fouling model description, cleaning procedures have been optimized by minimizing the Time Average Losses (TAL) under nominal operating conditions according to the well-established procedure. For this purpose, different cleaning actions, namely chemical and mechanical, have been accounted for. However, this procedure is strictly related to nominal operating conditions therefore perturbations, when present, could considerably compromise the process profitability due to unexpected shutdown or extraordinary maintenance operations. After a preliminary sensitivity analysis, the uncertain variables and the corresponding disturbance likelihood were estimated. Hence, cl... [more]
44. LAPSE:2021.0181
Carbon-Efficient Production Scheduling of a Bioethanol Plant Considering Diversified Feedstock Pelletization Density: A Case Study
April 16, 2021 (v1)
Subject: Planning & Scheduling
Keywords: bioethanol plant, carbon emission, dual-objective optimization, Scheduling
This paper presents a dual-objective optimization model for production scheduling of bioethanol plant with carbon-efficient strategies. The model is developed throughout the bioethanol production process. Firstly, the production planning and scheduling of the bioethanol plant’s transportation, storage, pretreatment, and ethanol manufacturing are fully considered. Secondly, the carbon emissions in the ethanol manufacturing process are integrated into the model to form a dual-objective optimization model that simultaneously optimizes the production plan and carbon emissions. The effects of different biomass raw materials with optional pelletization density and pretreatment methods on production scheduling are analyzed. The influence of demand and pretreatment cost on selecting a pretreatment method and total profit is considered. A membership weighted method is developed to solve the dual-objective model. The carbon emission model and economic model are integrated into one model for anal... [more]
45. LAPSE:2019.1399
Orchestrating an Effective Formulation to Investigate the Impact of EMSs (Energy Management Systems) for Residential Units Prior to Installation
December 10, 2019 (v1)
Subject: Energy Management
Keywords: appliance utility, BPSO, DR programs, DSM, EMS, energy efficiency gap, Scheduling, user comfort
Demand Response (DR) programs under the umbrella of Demand Side Management (DSM) tend to involve end users in optimizing their Power Consumption (PC) patterns and offer financial incentives to shift the load at “low-priced” hours. However, users have their own preferences of anticipating the amount of consumed electricity. While installing an Energy Management System (EMS), the user must be assured that this investment gives optimum comfort of bill savings, as well as appliance utility considering Time of Use (ToU). Moreover, there is a difference between desired load distribution and optimally-scheduled load across a 24-h time frame for lowering electricity bills. This difference in load usage timings, if it is beyond the tolerance level of a user, increases frustration. The comfort level is a highly variable phenomenon. An EMS giving optimum comfort to one user may not be able to provide the same level of satisfaction to another who has different preferences regarding electricity bill... [more]
46. LAPSE:2019.1040
Towards the Grand Unification of Process Design, Scheduling, and Control—Utopia or Reality?
September 23, 2019 (v1)
Subject: Interdisciplinary
Keywords: integration, process control, process design, Scheduling
As a founder of the Process Systems Engineering (PSE) discipline, Professor Roger W.H. Sargent had set ambitious goals for a systematic new generation of a process design paradigm based on optimization techniques with the consideration of future uncertainties and operational decisions. In this paper, we present a historical perspective on the milestones in model-based design optimization techniques and the developed tools to solve the resulting complex problems. We examine the progress spanning more than five decades, from the early flexibility analysis and optimal process design under uncertainty to more recent developments on the simultaneous consideration of process design, scheduling, and control. This formidable target towards the grand unification poses unique challenges due to multiple time scales and conflicting objectives. Here, we review the recent progress and propose future research directions.
47. LAPSE:2019.0766
Efficient Energy Consumption Scheduling: Towards Effective Load Leveling
July 26, 2019 (v1)
Subject: Planning & Scheduling
Keywords: demand response, demand side management, load leveling, Scheduling, smart grid
Different agents in the smart grid infrastructure (e.g., households, buildings, communities) consume energy with their own appliances, which may have adjustable usage schedules over a day, a month, a season or even a year. One of the major objectives of the smart grid is to flatten the demand load of numerous agents (viz. consumers), such that the peak load can be avoided and power supply can feed the demand load at anytime on the grid. To this end, we propose two Energy Consumption Scheduling (ECS) problems for the appliances held by different agents at the demand side to effectively facilitate load leveling. Specifically, we mathematically model the ECS problems as Mixed-Integer Programming (MIP) problems using the data collected from different agents (e.g., their appliances’ energy consumption in every time slot and the total number of required in-use time slots, specific preferences of the in-use time slots for their appliances). Furthermore, we propose a novel algorithm to efficie... [more]
48. LAPSE:2019.0613
Realizing Energy Savings in Integrated Process Planning and Scheduling
July 5, 2019 (v1)
Subject: Planning & Scheduling
Keywords: carbon emission, energy saving, integrated process planning &, MILP models, multi-objective optimization, Scheduling, TOPSIS
The integration of scheduling and process planning can eliminate resource conflicts and hence improve the performance of a manufacturing system. However, the focus of most existing works is mainly on the optimization techniques to improve the makespan criterion instead of more efficient uses of energy. In fact, with a deteriorating global climate caused by massive coal-fired power consumption, carbon emission reduction in the manufacturing sector is becoming increasingly imperative. To ease the environmental burden caused by energy consumption, e.g., coal-fired power consumption in use of machine tools, this research considers both makespan as well as environmental performance criteria, e.g., total power consumption, in integrated process planning and scheduling using a novel multi-objective memetic algorithm to facilitate a potential amount of energy savings; this can be realized through a better use of resources with more efficient scheduling schemes. A mixed-integer linear programmi... [more]
49. LAPSE:2018.0360
Optimal Multiscale Capacity Planning in Seawater Desalination Systems
July 31, 2018 (v1)
Subject: Optimization
Keywords: desalination, membrane distillation, multi-effect distillation, Optimization, process integration, Scheduling
The increasing demands for water and the dwindling resources of fresh water create a critical need for continually enhancing desalination capacities. This poses a challenge in distressed desalination network, with incessant water demand growth as the conventional approach of undertaking large expansion projects can lead to low utilization and, hence, low capital productivity. In addition to the option of retrofitting existing desalination units or installing additional grassroots units, there is an opportunity to include emerging modular desalination technologies. This paper develops the optimization framework for the capacity planning in distressed desalination networks considering the integration of conventional plants and emerging modular technologies, such as membrane distillation (MD), as a viable option for capacity expansion. The developed framework addresses the multiscale nature of the synthesis problem, as unit-specific decision variables are subject to optimization, as well... [more]
50. LAPSE:2018.0272
Using Simulation for Scheduling and Rescheduling of Batch Processes
July 31, 2018 (v1)
Subject: Planning & Scheduling
The problem of scheduling multiproduct and multipurpose batch processes has been studied for more than 30 years using math programming and heuristics. In most formulations, the manufacturing recipes are represented by simplified models using state task network (STN) or resource task network (RTN), transfers of materials are assumed to be instantaneous, constraints due to shared utilities are often ignored, and scheduling horizons are kept small due to the limits on the problem size that can be handled by the solvers. These limitations often result in schedules that are not actionable. A simulation model, on the other hand, can represent a manufacturing recipe to the smallest level of detail. In addition, a simulator can provide a variety of built-in capabilities that model the assignment decisions, coordination logic and plant operation rules. The simulation based schedules are more realistic, verifiable, easy to adapt for changing plant conditions and can be generated in a short perio... [more]