Operations Research, Systems Engineering and Industrial Engineering Commons^™

Research On Modeling And Scheduling Of Virtual Power Plant With Dual Demand Response, Qiang Chen, Yi Wang, Kangshun Li

Journal of System Simulation

Abstract: Virtual power plant technology provides an effective means to aggregate distributed power and user side resources to participate in power scheduling. Most of the existing research focus on the scheduling optimization of distributed energy instead of the demand response of user side. The user side resources are divided into contracted reliable response load and non-contracted random response load, and the load response is regulated through price adjustment mechanism to adapt to the change of distributed. A virtual power plant optimal scheduling model with dual demands response is constructed, in which the maximizing overall profit of the power grid is …

Scheduling Optimization Of Aluminum Extrusion Production Line Based On Timed Petri Net And Bso Algorithm, Yali Wu, Shuting He, Yanxi Yang, Lianqiang Feng, Fuqiang Wang, Yulu Chen

Journal of System Simulation

Abstract: For the problems of long production period and low efficiency caused by the complicated processes and large scheduling capacity of aluminum extrusion production line in industrial production, a timed Petri net (TdPN) scheduling model of aluminum extrusion production line is proposed and analyzed for reasonableness. The brain storm optimization (BSO) algorithm is introduced into the model, and an optimized scheduling algorithm for aluminum extrusion scheduling problems is proposed based on the individual encoding and decoding methods. The simulated annealing local search mechanism is used to improve the performance of BSO algorithm in the later stage, which can achieve the …

Scheduling, Complexity, And Solution Methods For Space Robot On-Orbit Servicing, Susan E. Sorenson

Graduate Theses and Dissertations

This research proposes problems, models, and solutions for the scheduling of space robot on-orbit servicing. We present the Multi-Orbit Routing and Scheduling of Refuellable On-Orbit Servicing Space Robots problem which considers on-orbit servicing across multiple orbits with moving tasks and moving refuelling depots. We formulate a mixed integer linear program model to optimize the routing and scheduling of robot servicers to accomplish on-orbit servicing tasks. We develop and demonstrate flexible algorithms for the creation of the model parameters and associated data sets. Our first algorithm creates the network arcs using orbital mechanics. We have also created a novel way to …

Design And Development Of A Simulation System For Scheduling In Cloud Manufacturing Based On Microservice Architecture, Yongkui Liu, Ming Zeng, Lin Zhang, Jinwei Guo, Siyang Yuan, Yaoyao Ping

Journal of System Simulation

Abstract: In view of the lack of the low coupling and highly extensible cloud manufacturing scheduling simulation system, that leads to inconvenience of the performance test on scheduling algorithms, a scalable cloud manufacturing scheduling model with the scheduling goal of the minimization of cost and completion time and the maximization of quality of service is proposed. A micro-service architecture based cloud manufacturing scheduling simulation system is designed and developed, which realizes the functions of system management, resource management, task management and simulation management, and has the characteristics of flexible autonomy, stability and scalability. The simulation system facilitates the …

Research On Optimization Of Network Resource Utilization In Static Segment Of Flexray Bus, Xinhang He, Erkang Li, Hongchao Zhang

Journal of System Simulation

Abstract: In order to improve the utilization of the network resources of the FlexRay bus, the network is optimized for static segment scheduling. The FlexRay communication mechanism is analyzed, the message model is established and the calculation method of bandwidth loss is derived, while considering the protocol overhead and network idling, taking the number of static frames and the length of the static frame payload as design variables, the overall optimal packaging scheme is obtained by solving this multi-objective optimization problem. This solution is finally applied to the vehicle chassis integrated control system for simulation analysis and verification. The results …

Hybrid Tabu Search Algorithm For Unrelated Parallel Machine Scheduling In Semiconductor Fabs With Setup Times, Job Release, And Expired Times, Changyu Chen, Madhi Fathi, Marzieh Khakifirooz, Kan Wu

Research Collection School Of Computing and Information Systems

This research is motivated by a scheduling problem arising in the ion implantation process of wafer fabrication. The ion implementation scheduling problem is modeled as an unrelated parallel machine scheduling (UPMS) problem with sequence-dependent setup times that are subject to job release time and expiration time of allowing a job to be processed on a specific machine, defined as: R|rj,eij,STsd|Cmax. The objective is first to maximize the number of processed jobs, then minimize the maximum completion time (makespan), and finally minimize the maximum completion times of the non-bottleneck machines. A mixed-integer programming (MIP) model is proposed as a solution approach …

A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu

Research Collection School Of Computing and Information Systems

This paper studies the integration of the vehicle routing problem with cross-docking (VRPCD). The aim is to find a set of routes to deliver products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic based on column generation is proposed. The first phase focuses on generating a set of feasible candidate routes in both pickup and delivery processes by implementing an adaptive large neighborhood search algorithm. A set of destroy and repair operators are …

A Survey Of Edge Computing Resource Allocation And Task Scheduling Optimization, Wang Ling, Chuge Wu, Wenhui Fan

Journal of System Simulation

Abstract: With the rapid development of Internet of Things (IoT) and mobile terminals, the concept of edge computing arises. By moving the computation and storage capacity to the edge of network, edge computing is able to deal with a large amount of data produced by IoT devices and the responsive request from IoT application. To improve the utility of edge resource, the quality of service and quality of user experience, resource allocation and task scheduling optimization problems under edge computing attract wide attention. It becomes more difficult due to the geographic separated and heterogeneous features of edge computing resource as …

Online Traffic Signal Control Through Sample-Based Constrained Optimization, Srishti Dhamija, Alolika Gon, Pradeep Varakantham, William Yeoh

Research Collection School Of Computing and Information Systems

Traffic congestion reduces productivity of individuals by increasing time spent in traffic and also increases pollution. To reduce traffic congestion by better handling dynamic traffic patterns, recent work has focused on online traffic signal control. Typically, the objective in traffic signal control is to minimize expected delay over all vehicles given the uncertainty associated with the vehicle turn movements at intersections. In order to ensure responsiveness in decision making, a typical approach is to compute a schedule that minimizes the delay for the expected scenario of vehicle movements instead of minimizing expected delay over the feasible vehicle movement scenarios. Such …

Review On Agv Scheduling Optimization, Jianlin Fu, Hengzhi Zhang, Zhang Jian, Liangkui Jiang

Journal of System Simulation

Abstract: AGV scheduling plays an important role in improving the efficiency and reducing manufacturing cost, but it is also a very complex combinatorial optimization procedure. AGV scheduling optimization is divided into three types, AGV static scheduling, AGV dynamic scheduling and AGV simultaneous scheduling with other resources scheduling. Various methods are summarized and listed, including traditional analysis method, modeling and simulation method, intelligent optimization algorithm and hybrid optimization method, and the advantages and disadvantages of each method are also analyzed. The deficiencies of AGV scheduling research are pointed out and the research directions for future are presented.

Research Overview On Modeling And Solution Of Aerospace Tt&C Scheduling Problem, Qingqing Yan, Huairong Shen, Qiongling Shao

Journal of System Simulation

Abstract: The research of Aerospace TT&C Scheduling (ATT&CS) is very important, because of its support for TT&C scheme decision-making and TT&C resource net constructing. The classification and resolution flow of the ATT&CS problem were introduced. Then, the modeling methods and related key techniques, such as designing of object function, analysis of constraints, and priority determining, were analyzed. The solving algorithms and conflict resolution methods were summed up, and the major categories of algorithm were evaluated. The main content of scheduling evaluation research was summarized. The possible future researches for related techniques were discussed based on the analysis of development and …

Simulation And Optimization For Bulk Terminal Yard Scheduling, Dongbo Hu, Li Pan, Binbin Zhang, Guozhi Liang

Journal of System Simulation

Abstract: Yard is the central part of the operation process of the whole terminal. In fact, the operation of lots of bulk terminal is unscientific, which severely restricts the turnover efficiency and the throughput of the terminal. Taking the coal terminal as an example and based on its operation process, the dispatching simulation model involving all parts of the operation was established and the rules of use of the yard grids was brought forward. By optimizing the operation strategy and related parameters, it is significant to improve the input quantity of bulk terminal and the turnover efficiency.

Modeling And Simulation On Railway Bulk Oil Transit Operations, Jingheng Ma, Xingchang Liu, Youhong Fan, Kang Jin

Journal of System Simulation

Abstract: The railway bulk oil transit operation is a hybrid (discrete/continuous) system because of the main body of the continuous flow oil and a variety of discrete events. According to the system’s characteristics of complex process, great difficulty, high risk, the oil transit operation model was established based on discrete rate simulation and system’s continuity, predict events, emergencies were analyzed. The model was converted into linear programming, the effective rate was calculated under constraints, and the operation process and event scheduling was simulated. It was verified that the model is feasible. By obtaining the dynamic behavior and real-time data, its …

Research On Modeling And Scheduling Of Cluster Tools With Reentrant Process, Chunrong Pan, Li Liang

Journal of System Simulation

Abstract: Cluster tools reconfigured are increasingly adopted in wafer fabrication. With single-wafer processing technology, the productivity and quality of semiconductor manufacturing have been improved. The configurations of cluster tools and constraints of operation processes were proposed. Due to the increase of processing requirements of wafer revisiting, the scheduling of cluster tools becomes more complicated. Thus, modeling, performance analyzing and scheduling of cluster tools with reentrant process were reviewed. Meanwhile, an illustrative example was given to show the feasibility of simulation scheduling. By analyzing the advantages and disadvantages of research methods available, approaches and future directions which would be effective for …

Scheduling Problem Of Unidirectional Material Handling System With Short-Cut, Juntao Li, Kun Xia, Kise Hiroshi

Journal of System Simulation

Abstract: Unidirectional circulation-type material handling system on a single loop with a shortcut is a typical and basic unit in a flexible manufacturing system or logistics system. It is widely used in semiconductor wafer fabrication system. Superposition efficiency of the basic unit often determines the one of the whole system. Different scheduling rules impact the interference between AGVs and then have an important effect on the efficiency of the whole system. To decrease the interference and improve performance of the system, a mathematical model of this system was made, analyzing this system by simulation and comparing the merits and …

Fault-Tolerant Method And Simulation Of Heterogeneous Multi-Core Processor Based On Speculative Mechanism, Shigan Yu, Zhimin Tang, Xiaochun Ye, Dongrui Fan

Journal of System Simulation

Abstract: Heterogeneous multicore is one of the important branches of processors,but they are still faced with frequent transient failures. TMR(Triple mode redundancy) is the main method to solve transient faults, which has the characteristics of low efficiency and high power consumption, a high-performance Fault-Tolerant Scheduling Algorithm with Speculative mechanism(FTSAS) is proposed. Each heterogeneous core can execute tasks independently, the state values of the first completed core are recorded, and the first completed core continues to perform the next task with forward speculative method. The results are compared by backward core, the majority consensus principle is adopted to ensure the reliability …

Cloud Job Scheduling Model Based On Improved Plant Growth Algorithm, Li Qiang, Xiaofeng Liu

Journal of System Simulation

Abstract: The performance of cloud job scheduling algorithm has a great importance to the whole cloud system. The key factors that affect cloud operation scheduling are found out, and a resource constraint model is established. The existing simulation plant growth algorithm is improved based on the Logistic model of plant growth law, so that the plant growth way was made to change according to the energy power. The comparison of four different plant models was carried out and their different features were analyzed. Compared with 6 typical cloud job scheduling algorithms, it is concluded that the improved simulation plant growth …

Optimization Of Scheduling Rule Of Unidirectional Material Handling System With Short-Cut, Juntao Li, Kun Xia, Kise Hiroshi

Journal of System Simulation

Abstract: To decrease the interference and improve the performance of a unidirectional circulation-type material handling system on a single loop with a shortcut, the interference and scheduling problem between AGVs are studied. According to the actual situation of material handling system, the interferences of two scheduling rules (random rule and order rule) are analyzed. An optimal scheduling rule under the interference case—exchange order rule is proposed. Different scheduling rules have an influence on the interference between AGVs and then have an important effect on the efficiency of the whole system. Experiment results show that the exchange order (E-Order) rule …

Sky Surveys Scheduling Using Reinforcement Learning, Andres Felipe Alba Hernandez

Graduate Research Theses & Dissertations

Modern cosmic sky surveys (e.g., CMB S4, DES, LSST) collect a complex diversity of astronomical objects. Each of class of objects presents different requirements for observation time and sensitivity. For determining the best sequence of exposures for mapping the sky systematically, conventional scheduling methods do not optimize the use of survey time and resources. Dynamic sky survey scheduling is an NP-hard problem that has been therefore treated primarily with heuristic methods. We present an alternative scheduling method based on reinforcement learning (RL) that aims to optimize the use of telescope resources for scheduling sky surveys.

We present an exploration of …

Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method, Bryant Jamison Spencer

Graduate Theses, Dissertations, and Problem Reports

In the pharmaceutical manufacturing world, a deadline could be the difference between losing a multimillion-dollar contract or extending it. This, among many other reasons, is why good scheduling methods are vital. This problem report addresses Flexible Flowshop (FF) scheduling using Simulated Annealing (SA) in conjunction with the Steepest Descent heuristic (SD).

FF is a generalized version of the flowshop problem, where each product goes through S number of stages, where each stage has M number of machines. As opposed to a normal flowshop problem, all ‘jobs’ do not have to flow in the same sequence from stage to stage. The …

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the Generalized OP, the Arc OP, …

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

Duplicate record, see https://ink.library.smu.edu.sg/sis_research/3271. The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the …

Dual Formulations For Optimizing Dec-Pomdp Controllers, Akshat Kumar, Hala Mostafa, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Decentralized POMDP is an expressive model for multi-agent planning. Finite-state controllers (FSCs)---often used to represent policies for infinite-horizon problems---offer a compact, simple-to-execute policy representation. We exploit novel connections between optimizing decentralized FSCs and the dual linear program for MDPs. Consequently, we describe a dual mixed integer linear program (MIP) for optimizing deterministic FSCs. We exploit the Dec-POMDP structure to devise a compact MIP and formulate constraints that result in policies executable in partially-observable decentralized settings. We show analytically that the dual formulation can also be exploited within the expectation maximization (EM) framework to optimize stochastic FSCs. The resulting EM algorithm …

Strategic Planning For Setting Up Base Stations In Emergency Medical Systems, Supriyo Ghosh, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Emergency Medical Systems (EMSs) are an important component of public health-care services. Improving infrastructure for EMS and specifically the construction of base stations at the ”right” locations to reduce response times is the main focus of this paper. This is a computationally challenging task because of the: (a) exponentially large action space arising from having to consider combinations of potential base locations, which themselves can be significant; and (b) direct impact on the performance of the ambulance allocation problem, where we decide allocation of ambulances to bases. We present an incremental greedy approach to discover the placement of bases that …

Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau

Shih-Fen Cheng

In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …

Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau

Shih-Fen Cheng

In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …

Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau

Shih-Fen CHENG

In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …

Patient-Centered Appointment Scheduling Using Agent-Based Simulation, Tammy Toscos, Ayten Turkcan, Brad Doebbeling

Tammy R Toscos

Enhanced access and continuity are key components of patient-centered care. Existing studies show that several interventions such as providing same day appointments, walk-in services, after-hours care, and group appointments, have been used to redesign the healthcare systems for improved access to primary care. However, an intervention focusing on a single component of care delivery (i.e. improving access to acute care) might have a negative impact other components of the system (i.e. reduced continuity of care for chronic patients). Therefore, primary care clinics should consider implementing multiple interventions tailored for their patient population needs. We collected rapid ethnography and observations to …

Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev

Dissertations, Theses, and Capstone Projects

In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and …

Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We study a real-world problem arising from the operations of a hospital service provider, which we term the master physician scheduling problem. It is a planning problem of assigning physicians’ full range of day-to-day duties (including surgery, clinics, scopes, calls, administration) to the defined time slots/shifts over a time horizon, incorporating a large number of constraints and complex physician preferences. The goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We propose mathematical programming models that represent different variants of this problem. The models were tested on a real …