Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Scheduling, Complexity, And Solution Methods For Space Robot On-Orbit Servicing, Susan E. Sorenson
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
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
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
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 …