1,838 results
Search Results
2. Evaluation of Work Stealing Algorithms
- Author
-
Numpaque, Juan Sebatían, Cardozo, Nicolás, Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Prates, Raquel Oliveira, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, Gonzalez, Enrique, editor, Curiel, Mariela, editor, Moreno, Andrés, editor, Carrillo-Ramos, Angela, editor, Páez, Rafael, editor, and Flórez-Valencia, Leonardo, editor
- Published
- 2022
- Full Text
- View/download PDF
3. Niching-Based Feature Selection with Multi-tree Genetic Programming for Dynamic Flexible Job Shop Scheduling
- Author
-
Zakaria, Yahia, Zakaria, Yassin, BahaaElDin, Ahmed, Hadhoud, Mayada, Kacprzyk, Janusz, Series Editor, Merelo, Juan Julián, editor, Garibaldi, Jonathan, editor, Linares-Barranco, Alejandro, editor, Warwick, Kevin, editor, and Madani, Kurosh, editor
- Published
- 2021
- Full Text
- View/download PDF
4. Performance of Static and Dynamic Task Scheduling for Real-Time Engine Control System on Embedded Multicore Processor
- Author
-
Oki, Yoshitake, Mikami, Hiroki, Nishida, Hikaru, Umeda, Dan, Kimura, Keiji, Kasahara, Hironori, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Pande, Santosh, editor, and Sarkar, Vivek, editor
- Published
- 2021
- Full Text
- View/download PDF
5. Towards Interference-Aware Dynamic Scheduling in Virtualized Environments
- Author
-
Meyer, Vinícius, Ludwig, Uillian L., Xavier, Miguel G., Kirchoff, Dionatrã F., De Rose, Cesar A. F., Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Klusáček, Dalibor, editor, Cirne, Walfredo, editor, and Desai, Narayan, editor
- Published
- 2020
- Full Text
- View/download PDF
6. Dynamic SIMD Vector Lane Scheduling
- Author
-
Krzikalla, Olaf, Wende, Florian, Höhnerbach, Markus, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Taufer, Michela, editor, Mohr, Bernd, editor, and Kunkel, Julian M., editor
- Published
- 2016
- Full Text
- View/download PDF
7. Dynamic Scheduling in Real Time with Budget Constraints in Hybrid Clouds
- Author
-
Marcu, Ovidiu-Cristian, Negru, Catalin, Pop, Florin, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Altmann, Jörn, editor, Silaghi, Gheorghe Cosmin, editor, and Rana, Omer F., editor
- Published
- 2016
- Full Text
- View/download PDF
8. Enhancing Parallelism of Tile Bidiagonal Transformation on Multicore Architectures Using Tree Reduction
- Author
-
Ltaief, Hatem, Luszczek, Piotr, Dongarra, Jack, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Wyrzykowski, Roman, editor, Dongarra, Jack, editor, Karczewski, Konrad, editor, and Waśniewski, Jerzy, editor
- Published
- 2012
- Full Text
- View/download PDF
9. Research and Implementation of Asynchronous Concurrent Scheduling Model for Online System
- Author
-
Wang, Sheng-Ming, Xu, Tai-Shan, Xu, Jian-Bing, Fang, Yong-Jie, Ji, Ye-Fei, and Wu, Yanwen, editor
- Published
- 2011
- Full Text
- View/download PDF
10. A Reconfigurable Multi-standard Radio Platform
- Author
-
Immonen, Antti, Pärssinen, Aarno, Zetterman, Tommi, Talonen, Mikko, Ryynänen, Jussi, Kiminki, Sami, Hirvisalo, Vesa, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Rodriguez, Jonathan, editor, Tafazolli, Rahim, editor, and Verikoukis, Christos, editor
- Published
- 2012
- Full Text
- View/download PDF
11. Dynamic Resource Scheduling and Workflow Management in Cloud Computing
- Author
-
Shi, Xuelin, Zhao, Ying, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Chiu, Dickson K. W., editor, Bellatreche, Ladjel, editor, Sasaki, Hideyasu, editor, Leung, Ho-fung, editor, Cheung, Shing-Chi, editor, Hu, Haiyang, editor, and Shao, Jie, editor
- Published
- 2011
- Full Text
- View/download PDF
12. Time Scheduling Based on Tradeoff between Detection Performance and QoS Requirement
- Author
-
Sun, Jun, Zhu, Hongbo, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Sithamparanathan, Kandeepan, editor, and Marchese, Mario, editor
- Published
- 2009
- Full Text
- View/download PDF
13. Dynamic Resource-Critical Workflow Scheduling in Heterogeneous Environments
- Author
-
Gong, Yili, Pierce, Marlon E., Fox, Geoffrey C., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Frachtenberg, Eitan, editor, and Schwiegelshohn, Uwe, editor
- Published
- 2009
- Full Text
- View/download PDF
14. An Algorithm-by-Blocks for SuperMatrix Band Cholesky Factorization
- Author
-
Quintana-Ortí, Gregorio, Quintana-Ortí, Enrique S., Remón, Alfredo, van de Geijn, Robert A., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Palma, José M. Laginha M., editor, Amestoy, Patrick R., editor, Daydé, Michel, editor, Mattoso, Marta, editor, and Lopes, João Correia, editor
- Published
- 2008
- Full Text
- View/download PDF
15. Digital twin-driven dynamic scheduling of a hybrid flow shop.
- Author
-
Tliba, Khalil, Diallo, Thierno M. L., Penas, Olivia, Ben Khalifa, Romdhane, Ben Yahia, Noureddine, and Choley, Jean-Yves
- Subjects
FLOW shop scheduling ,MIXED integer linear programming ,DIGITAL twins ,ELECTRONIC paper - Abstract
Industries require, nowadays, to be more adaptable to unforeseen real-time events as well as to the rapid evolution of their market (e.g. multiplication of customers, increasingly personalized and unpredictable demand, etc.). To meet these challenges, manufacturers need new solutions to update their production plan when a change in the production system or its environment occurs. In this context, our research work deals with a dynamic scheduling problem of a real Hybrid Flow Shop considering the specific constraints of a perfume manufacturing company. This paper proposes a Digital Twin-driven dynamic scheduling approach based on the combination of both optimization and simulation. For the optimization, we have developed a mixed integer linear programming (MILP) scheduling model taking into account the main specific scheduling requirements of our case study. Regarding the simulation approach, a 3D shop floor model has been developed including the additional stochastic aspects and constraints which are difficult or impossible to model with a MILP approach. These two models are connected with the real shop floor to create a digital twin (DT). The developed DT allows the re-scheduling of production according to internal and external events. Finally, validation scenarios on a perfume case study have been designed and implemented in order to demonstrate the feasibility and the relevance of the proposed digital twin-driven dynamic scheduling approach. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
16. Environment, resources, and surroundings based dynamic project schedule model for the road construction industry in New Zealand
- Author
-
Purushothaman, Mahesh Babu and Kumar, Sumit
- Published
- 2022
- Full Text
- View/download PDF
17. Dynamic scheduling model for the construction industry
- Author
-
Fahmy, Amer, Hassan, Tarek, Bassioni, Hesham, and McCaffer, Ronald
- Published
- 2020
- Full Text
- View/download PDF
18. An improved deep reinforcement learning-based scheduling approach for dynamic task scheduling in cloud manufacturing.
- Author
-
Xiaohan Wang, Lin Zhang, Yongkui Liu, and Yuanjun Laili
- Subjects
DEEP reinforcement learning ,REINFORCEMENT learning ,SCHEDULING - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
19. Research on Berth Hoisting Planning Based on Digital Twin.
- Author
-
Lipeiyong, Zhaoqiqiang, Hefeiyue, Gaoxiang, Songlifei, and Wangchong
- Subjects
DIGITAL twins ,DIGITAL technology ,INFORMATION sharing - Abstract
Aiming at the problem that the disturbance factors affect the smooth development of berth hoisting, a hoisting planning architecture based on digital twin is proposed. The berth hoisting sequence planning model and its implementation technology are studied. The model includes three parts: the digital space for formulating the hoisting scheme, the physical space for executing the block hoisting, and the information interaction between the two parts. This paper discusses the berth hoisting planning method based on digital twin, constructs the information exchange platform of digital space and physical space, develops the berth hoisting information exchange platform based on digital twin, and simulates the block hoisting planning by using DELMIA software. An example is given to simulate the operation of the hoisting planning platform. The results show that the work of this paper has a certain reference significance to solve the influence of disturbance factors on berth hoisting sequence planning. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
20. Dynamic Intelligent Scheduling in Low-Carbon Heterogeneous Distributed Flexible Job Shops with Job Insertions and Transfers.
- Author
-
Chen, Yi, Liao, Xiaojuan, Chen, Guangzhu, and Hou, Yingjie
- Subjects
DEEP reinforcement learning ,REINFORCEMENT learning ,PRODUCTION scheduling ,JOB shops ,SCHEDULING ,FLOW shops ,INTELLIGENT buildings - Abstract
With the rapid development of economic globalization and green manufacturing, traditional flexible job shop scheduling has evolved into the low-carbon heterogeneous distributed flexible job shop scheduling problem (LHDFJSP). Additionally, modern smart manufacturing processes encounter complex and diverse contingencies, necessitating the ability to address dynamic events in real-world production activities. To date, there are limited studies that comprehensively address the intricate factors associated with the LHDFJSP, including workshop heterogeneity, job insertions and transfers, and considerations of low-carbon objectives. This paper establishes a multi-objective mathematical model with the goal of minimizing the total weighted tardiness and total energy consumption. To effectively solve this problem, diverse composite scheduling rules are formulated, alongside the application of a deep reinforcement learning (DRL) framework, i.e., Rainbow deep-Q network (Rainbow DQN), to learn the optimal scheduling strategy at each decision point in a dynamic environment. To verify the effectiveness of the proposed method, this paper extends the standard dataset to adapt to the LHDFJSP. Evaluation results confirm the generalization and robustness of the presented Rainbow DQN-based method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
21. A two-level evolutionary algorithm for dynamic scheduling in flexible job shop environment
- Author
-
Saouabi, Mohamed Dhia Eddine, Nouri, Houssem Eddine, and Belkahla Driss, Olfa
- Published
- 2024
- Full Text
- View/download PDF
22. A Review on Intelligent Scheduling and Optimization for Flexible Job Shop
- Author
-
Jiang, Bin, Ma, Yajie, Chen, Lijun, Huang, Binda, Huang, Yuying, and Guan, Li
- Published
- 2023
- Full Text
- View/download PDF
23. How Environment Dynamics Affects Production Scheduling: Requirements for Development of CPPS Models.
- Author
-
Alves, Cátia, Putnik, Goran D., and Varela, Leonilde
- Subjects
CYBER physical systems ,MANUFACTURING processes ,PRODUCTION scheduling ,INDUSTRY 4.0 ,DECISION making ,ECOLOGY - Abstract
Copyright of FME Transactions is the property of University of Belgrade, Faculty of Mechanical Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2021
- Full Text
- View/download PDF
24. Optimized Multiagent Routing for a Class of Guidepath-Based Transport Systems.
- Author
-
Daugherty, Greyson, Reveliotis, Spyros, and Mohler, Greg
- Subjects
MULTIAGENT systems ,QUANTUM computing ,STRUCTURAL optimization ,RESOURCE management ,TRAFFIC congestion - Abstract
This paper presents a heuristic algorithm for minimizing the makespan required to route a set of agents inhabiting a shared guidepath network from their initial locations to their respective destinations while observing a set of regulations that seek to ensure the safety and the integrity of the generated traffic. From an application standpoint, the presented developments are motivated by the traffic coordination challenges that arise in the context of many automated unit-load material handling systems and also in the transport of the ionized atoms that takes place in the context of quantum computing. From a methodological standpoint, our developments constitute a customization of the general “local-search” framework of combinatorial optimization theory to the traffic management problem that is considered in this paper. Hence, the presented results include a rigorous characterization of the considered problem and its solution space, detailed algorithms for the construction of the necessary initial solutions and the improving step for the pursued search, a complexity analysis of these algorithms, and a set of computational experiments that reveal and assess the computational efficiency of the presented algorithms and the efficacy of the derived solutions. The paper concludes with some suggestions for potential extensions of the presented results. Note to Practitioners—In many contemporary applications of automation science and engineering, a number of entities—or “agents”—must be transported expediently from their initial locations to certain destinations using a set of links that define the underlying “guidepath network.” Furthermore, various safety considerations require that the agents must be adequately separated during these transports, and the imposed restrictions turn the corresponding traffic coordination problem into a complex resource allocation problem, where the contested resources are the guidepath-network links. This paper presents a set of algorithms that can provide high-quality schedules for the resulting traffic-scheduling problems in a computationally efficient manner. These properties of our algorithms are established through the necessary theoretical analysis, but they are also demonstrated through a series of numerical experiments where they are shown capable to provide near-optimal solutions for some very complex problem instances in no more than a few seconds. In addition, our algorithms are “complete,” i.e., they will always provide a feasible schedule for any instantiation of the traffic-scheduling problem considered in this paper. Hence, they can effectively address the needs for “real-time” traffic management that arise in the context of the considered applications. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
25. Assembly line balancing and optimal scheduling for flexible manufacturing workshop
- Author
-
Hou, Wen and Zhang, Song
- Published
- 2024
- Full Text
- View/download PDF
26. Neuro-Evolution of Augmenting Topologies for Dynamic Scheduling of Hybrid Flow Shop Problem.
- Author
-
Junjie Zhang, Yarong Chen, Mumtaz, Jabir, and Shengwei Zhou
- Subjects
AUGMENTED reality ,REINFORCEMENT learning ,MACHINE learning ,MAINTENANCE ,RAYLEIGH number - Abstract
In this paper, the Neuro-Evolution of Augmenting Topologies (NEAT) algorithm is proposed to minimize the maximum completion time in a dynamic scheduling problem of hybrid flow shops. In hybrid flow shops, machines require flexible preventive maintenance and jobs arrive randomly with uncertain processing times. The NEAT-based approach is experimentally compared with the SPT and FIFO scheduling rules by designing problem instances. The results show that the NEAT-based scheduling method can obtain solutions with better convergence while responding quickly compared to the scheduling rules. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
27. Dynamic Beam Pattern and Bandwidth Allocation Based on Multi-Agent Deep Reinforcement Learning for Beam Hopping Satellite Systems.
- Author
-
Lin, Zhiyuan, Ni, Zuyao, Kuang, Linling, Jiang, Chunxiao, and Huang, Zhen
- Subjects
REINFORCEMENT learning ,BANDWIDTH allocation ,MULTI-degree of freedom ,HEURISTIC algorithms ,GENETIC algorithms - Abstract
Due to the non-uniform geographic distribution and time-varying characteristics of the ground traffic request, how to make full use of the limited beam resources to serve users flexibly and efficiently is a brand-new challenge for beam hopping satellite systems. The conventional greedy-based beam hopping methods do not consider the long-term reward, which is difficult to deal with the time-varying traffic demand. Meanwhile, the heuristic algorithms such as genetic algorithm have a slow convergence time, which can not achieve real-time scheduling. Furthermore, existing methods based on deep reinforcement learning (DRL) only make decisions on beam patterns, lack of the freedom of bandwidth. This paper proposes a dynamic beam pattern and bandwidth allocation scheme based on DRL, which flexibly uses three degrees of freedom of time, space and frequency. Considering that the joint allocation of bandwidth and beam pattern will lead to an explosion of action space, a cooperative multi-agents deep reinforcement learning (MADRL) framework is presented in this paper, where each agent is only responsible for the illumination allocation or bandwidth allocation of one beam. The agents can learn to collaborate by sharing the same reward to achieve the common goal, which refers to maximize the throughput and minimize the delay fairness between cells. Simulation results demonstrate that the offline trained MADRL model can achieve real-time beam pattern and bandwidth allocation to match the non-uniform and time-varying traffic request. Furthermore, when the traffic demand increases, our model has a good generalization ability. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
28. Research on Dynamic Scheduling Model of Plant Protection UAV Based on Levy Simulated Annealing Algorithm.
- Author
-
Chen, Cong, Li, Yibai, Cao, Guangqiao, and Zhang, Jinlong
- Abstract
The plant protection unmanned aerial vehicle (UAV) scheduling model is of great significance to improve the operation income of UAV plant protection teams and ensure the quality of the operation. The simulated annealing algorithm (SA) is often used in the optimization solution of scheduling models, but the SA algorithm has the disadvantages of easily falling into local optimum and slow convergence speed. In addition, the current research on the UAV scheduling model for plant protection is mainly oriented to static scenarios. In the actual operation process, the UAV plant protection team often faces unexpected situations, such as new orders and changes in transfer path costs. The static model cannot adapt to such emergencies. In order to solve the above problems, this paper proposes to use the Levi distribution method to improve the simulated annealing algorithm, and it proposes a dynamic scheduling model driven by unexpected events, such as new orders and transfer path changes. Order sorting takes into account such factors as the UAV plant protection team's operating income, order time window, and job urgency, and prioritizes job orders. In the aspect of order allocation and solution, this paper proposes a Levy annealing algorithm (Levy-SA) to solve the scheduling strategy of plant protection UAVs in order to solve the problem that the traditional SA is easy to fall into local optimum and the convergence speed is slow. This paper takes the plant protection operation scenario of "one spray and three defenses" for wheat in Nanjing City, Jiangsu Province, as an example, to test the plant protection UAV scheduling model under the dynamic conditions of new orders and changes in transfer costs. The results show that the plant protection UAV dynamic scheduling model proposed in this paper can meet the needs of plant protection UAV scheduling operations in static and dynamic scenarios. Compared with SA and greedy best first search algorithm (GBFS), the proposed Levy-SA has better performance in static and dynamic programming scenarios. It has more advantages in terms of man-machine adjustment distance and total operation time. This research can provide a scientific basis for the dynamic scheduling and decision analysis of plant protection UAVs, and provide a reference for the development of an agricultural machinery intelligent scheduling system. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
29. Dynamic Events in the Flexible Job-Shop Scheduling Problem: Rescheduling with a Hybrid Metaheuristic Algorithm.
- Author
-
Fuladi, Shubhendu Kshitij and Kim, Chang-Soo
- Subjects
PRODUCTION scheduling ,METAHEURISTIC algorithms ,PRODUCTION planning ,SIMULATED annealing ,MANUFACTURING processes ,TABU search algorithm - Abstract
In the real world of manufacturing systems, production planning is crucial for organizing and optimizing various manufacturing process components. The objective of this paper is to present a methodology for both static scheduling and dynamic scheduling. In the proposed method, a hybrid algorithm is utilized to optimize the static flexible job-shop scheduling problem (FJSP) and dynamic flexible job-shop scheduling problem (DFJSP). This algorithm integrates the genetic algorithm (GA) as a global optimization technique with a simulated annealing (SA) algorithm serving as a local search optimization approach to accelerate convergence and prevent getting stuck in local minima. Additionally, variable neighborhood search (VNS) is utilized for efficient neighborhood search within this hybrid algorithm framework. For the FJSP, the proposed hybrid algorithm is simulated on a 40-benchmark dataset to evaluate its performance. Comparisons among the proposed hybrid algorithm and other algorithms are provided to show the effectiveness of the proposed algorithm, ensuring that the proposed hybrid algorithm can efficiently solve the FJSP, with 38 out of 40 instances demonstrating better results. The primary objective of this study is to perform dynamic scheduling on two datasets, including both single-purpose machine and multi-purpose machine datasets, using the proposed hybrid algorithm with a rescheduling strategy. By observing the results of the DFJSP, dynamic events such as a single machine breakdown, a single job arrival, multiple machine breakdowns, and multiple job arrivals demonstrate that the proposed hybrid algorithm with the rescheduling strategy achieves significant improvement and the proposed method obtains the best new solution, resulting in a significant decrease in makespan. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. On Stackelberg’s oligopoly theory
- Author
-
Heertje, Arnold
- Published
- 1996
- Full Text
- View/download PDF
31. Taipower′s coal logistics system
- Author
-
Tzeng, Gwo‐Hshiung, Hwang, Ming‐Jiu, and Ting, Shih‐Chan
- Published
- 1995
- Full Text
- View/download PDF
32. Investigation of scheduling integration of flexible manufacturing systems for mass customisation.
- Author
-
He, Yumin and Smith, Milton L.
- Subjects
FLEXIBLE manufacturing systems ,PRODUCT costing ,FLEXTIME ,PRICES - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
33. Scheduling in Industrial environment toward future: insights from Jean-Marie Proth.
- Author
-
Khakifirooz, Marzieh, Fathi, Michel, Dolgui, Alexandre, and Pardalos, Panos M.
- Subjects
PRODUCTION scheduling ,SCHEDULING ,RESEARCH personnel ,ENGINEERING equipment ,METHODS engineering - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
34. Intelligent dynamic scheduling system: the application of genetic algorithms
- Author
-
Jahangirian, M. and Conroy, G.V.
- Published
- 2000
- Full Text
- View/download PDF
35. A Correction and Some Comments on the Article “Polynomially Complex Synthesis of Distributed Supervisors for Large-Scale AMSs Using Petri Nets”.
- Author
-
Reveliotis, Spyros
- Subjects
PETRI nets ,MANUSCRIPTS - Abstract
The main purpose of this correspondence is to point out the fallacy of Theorem 1 in the paper that is mentioned in the title, a result that attempts to provide a structural characterization for the liveness of the Petri net class considered in the manuscript. The closing part of the correspondence also takes this opportunity to make some further remarks on the results that are claimed in the paper. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
36. Minimizing the Age-of-Critical-Information: An Imitation Learning-Based Scheduling Approach Under Partial Observations.
- Author
-
Wang, Xiaojie, Ning, Zhaolong, Guo, Song, Wen, Miaowen, and Poor, H. Vincent
- Subjects
HEURISTIC algorithms ,MOBILE learning ,SCHEDULING ,INFORMATION society ,DECISION making ,MOBILE computing - Abstract
Age of Information (AoI) has become an important metric to evaluate the freshness of information, and studies of minimizing AoI in wireless networks have drawn extensive attention. In mobile edge networks, changes in critical levels for distinct information is important for users’ decision making, especially when merely partial observations are available. However, existing research has not yet addressed this issue, which is the subject of this paper. To address this issue, we first establish a system model, in which the information freshness is quantified by changes in its critical levels. We formulate Age-of-Critical-Information (AoCI) minimization as an optimization problem, with the purpose of minimizing the average relative AoCI of mobile clients to help them make timely decisions. Then, we propose an information-aware heuristic algorithm that can reach optimal performance with full obsevations in an offline manner. For online scheduling, an imitation learning-based scheduling approach is designed to choose update preferences for mobile clients under partial observations, where policies obtained by the above heuristic algorithm are utilized for expert policies. Finally, we demonstrate the superiority of our designed algorithm from both theoretical and experimental perspectives. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
37. Alternating Optimization Approach for Voltage-Secure Multi-Period Optimal Reactive Power Dispatch.
- Author
-
Ibrahim, Tamer, Rubira, Tomas Tinoco De, Rosso, Alberto Del, Patel, Mahendra, Guggilam, Swaroop, and Mohamed, Ahmed A.
- Subjects
REACTIVE power ,ELECTRIC networks ,ELECTRIC utilities ,POWER resources ,SYNCHRONOUS generators ,INTEGRATED software - Abstract
This paper proposes an optimization approach for day-ahead reactive power planning to improve voltage security in transmission networks. The problem is formulated as a voltage-secure multi-period optimal reactive power dispatch (MP-ORPD) problem. The optimization approach searches for optimal set-points of dynamic and static reactive power (var) resources. Specifically, the output includes set-points for switching shunts, transformer taps, and voltage magnitudes at the regulated buses. The primary goal is to maximize the dynamic reactive power reserve of the system, by minimizing the reactive power supplied by synchronous generators. As the size of the MP-ORPD problem increases significantly with increasing number of contingencies and time periods, efficiency is crucial for practical applications. In this paper, a decomposition technique based on consensus and alternating optimization, where integer variable targets are obtained via MILP, is used to partition the MP-ORPD problem into a set of subproblems, which can be solved in parallel to reduce the computation time. The proposed MP-ORPD problem and its solution algorithm are integrated into the EPRI-VCA software. The results of various power networks of large electric utilities in the Eastern interconnection demonstrate the effectiveness of the proposed algorithm in providing preventive control schedules. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
38. A data-driven scheduling knowledge management method for smart shop floor.
- Author
-
Ma, Yumin, Li, Shengyi, Qiao, Fei, Lu, Xiaoyu, and Liu, Juan
- Subjects
PRODUCTION scheduling ,KNOWLEDGE management ,MACHINE learning ,RETAIL stores ,FLOORING - Abstract
The data-driven method has been widely used to mine knowledge from the smart shop floors' production data to guide dynamic scheduling. However, the mined knowledge may be invalid when the production scene changes. In order to address this problem and ensure the validity of the knowledge, this paper studies a data-driven scheduling knowledge life-cycle management (SKLM) method for the smart shop floor. The proposed method includes four phases: knowledge generation, knowledge application, online knowledge evaluation, and knowledge update. Specifically, the extreme learning machine (ELM) is applied to learn knowledge based on the composite scheduling rules. The quality control theory is used to evaluate the quality of scheduling knowledge. And the online sequential ELM (OS-ELM) is adopted to update the knowledge. Knowledge life-cycle management is implemented through the iterative knowledge update. The proposed method is validated on the MIMAC6, which is a simulation model of the semiconductor production line. Experimental results show that the proposed method could improve the effectiveness of scheduling knowledge and further optimize the performance of the smart shop floor. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
39. Distributed job-shop rescheduling problem considering reconfigurability of machines: a self-adaptive hybrid equilibrium optimiser.
- Author
-
Mahmoodjanloo, M., Tavakkoli-Moghaddama, R., Baboli, A., and Bozorgi-Amiri, A.
- Subjects
MANUFACTURING processes ,MACHINE tools ,STOCHASTIC systems ,TECHNOLOGICAL innovations ,NP-hard problems - Abstract
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]
- Published
- 2022
- Full Text
- View/download PDF
40. Network‐based project planning and scheduling
- Author
-
Khamooshi, Homayoun
- Published
- 1996
- Full Text
- View/download PDF
41. Auction-Based Mechanism for Dynamic and Efficient Resource Allocation.
- Author
-
Zou, Suli, Ma, Zhongjing, and Liu, Xiangdong
- Subjects
ALLOCATION (Accounting) ,AUCTIONS ,NASH equilibrium - Abstract
We study how to efficiently allocate the infinitesimal divisible resource under auction mechanism in a dynamic way. We propose a Vickrey–Clarke–Groves-type auction mechanism with a 2-D bid which specifies a per unit price and a maximum of the demand. Due to the absence of enough information related to the infinite dimensional valuations of individual players in a single-bid strategy, it is challenging to implement the efficient Nash equilibrium (NE) in a dynamic way. In this paper, we introduce a pair of parameters related to players’ valuations, and design a decentralized dynamic process assisted with this pair of values, such that at each iteration, a single player updates its best bid under a constrained set of demand. Under the proposed auction mechanism, we show the incentive compatibility, efficiency, and uniqueness of the NE. Furthermore, our method is guaranteed to converge to the efficient NE, and it presents the enhanced convergence performance compared with those methods proposed in the literature. Case studies are given to demonstrate the results developed in this paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
42. Research on Solving Flexible Job Shop Scheduling Problem Based on Improved GWO Algorithm SS-GWO.
- Author
-
Zhou, Kai, Tan, Chuanhe, Zhao, Yi, Yu, Junyuan, Zhang, Zhilong, and Wu, Yanqiang
- Abstract
As an important branch of production scheduling, the flexible job shop scheduling problem (FJSP) is a typical NP-hard problem. Researchers have adopted many intelligent algorithms to solve the FJSP problem, nonetheless, the task of dynamically adapting its essential parameters during the computational process is a significant challenge, resulting in the solution efficiency and quality failing to meet the production requirements. To this end, this paper proposes an adaptive gray wolf fast optimization algorithm (SS-GWO), which adopts the gray wolf algorithm (GWO) as the basic optimization method, and the algorithm adaptively selects the global search or local search according to the degree of agglomeration of individuals. Firstly, a non-linear convergence factor strategy is employed to control the global exploration and local exploitation capabilities of the algorithm at different stages. This enhances optimization precision and accelerates convergence speed, achieving a dynamic balance between the two. Secondly, the spiral search mechanism of Whale Optimization Algorithm is used in GWO to improve the exploration capability of Gray Wolf Optimization Algorithm. Finally, the effectiveness of SS-GWO model is verified by comparison experiments. The comparison demonstrates the superiority of SS-GWO over the other five state-of-the-art algorithms in solving the 22 classical benchmark test functions. SS-GWO is applied to solve FJSP by means of the standard test function bandimarte calculus. The optimal solution and performance of SS-GWO for solving FJSP are compared with other algorithms. The experimental results show that the SS-GWO algorithm has good optimization performance, and the maximum completion time is reduced by 19% and 37% compared with that of IGWO and GWO, respectively, and the proposed SS-GWO algorithm achieves a better solution effect on flexible job shop scheduling instances, which can satisfy the actual production scheduling needs. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
43. Energy and Delay Guaranteed Joint Beam and User Scheduling Policy in 5G CoMP Networks.
- Author
-
Kim, Yeongjin, Jeong, Jaehwan, Ahn, Suyoung, Kwak, Jeongho, and Chong, Song
- Abstract
Massive Multi-Input Multi-Output (MIMO) and Coordinated MultiPoint (CoMP) technologies in Cloud-RAN (C-RAN) architecture become inevitable trend due to the advent of next-generation mobile applications, which are traffic-intensive, such as ultra high definition (UHD) video. In this paper, we study a joint beam activation and user scheduling problem in a 5G cellular network with massive MIMO and CoMP utilizing orthogonal random beamforming technique. This paper aims to minimize total Remote Radio Heads’ (RRHs’) energy expenditure in a dynamic C-RAN architecture while ensuring finite service time for all user traffic arrivals in the communication coverage. We leverage Lyapunov drift-plus-penalty framework to transform an original long-term average problem into a series of per-slot modified problems. Since the provided per-slot problem is combinatorial and nonlinear optimization problem, we are inspired by a greedy algorithm to design energy and delay guaranteed joint beam activation and user scheduling policy, namely BEANS. We prove that the proposed BEANS ensures finite upper bounds of average RRH energy consumption and average queue backlogs for all traffic arrival rates within constant ratio of capacity region and all energy-delay tradeoff parameters. These proofs are the first attempt to theoretically demonstrate guarantees of energy and queue bounds in a framework consisting of possibly negative submodular objective function and non-matriod constraints. Finally, via extensive simulations, we compare the capacity region and energy-queue backlog tradeoff of BEANS with optimal and existing algorithms, and show that BEANS attains up to 65% of energy saving for the same average queue backlog compared to the algorithms which do not take traffic dynamics and energy consumption into considerations. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
44. Digital Twin Based SUDIHA Architecture to Smart Shopfloor Scheduling.
- Author
-
Khadiri, Hassan, Sekkat, Souhail, and Herrou, Brahim
- Subjects
DIGITAL twins ,INDUSTRY 4.0 ,MANUFACTURING processes ,SCHEDULING ,CYBER physical systems - Abstract
Standing on the brink of the fourth industrial revolution, Cyber Physical Systems (CPS) are considered the basic components of the Smart Factory. One important challenge in cyber physical production systems is dynamic scheduling that can handle random disruptions such as failures, raw material shortages and quality defects. To achieve dynamic scheduling, we have proposed a Supervised and Distributed Holonic architecture we called SUDIHA. This architecture incorporates three Holons: Product Holon, Resource Holon and Order Holon and combines global supervision, achieved by Product Holon, with dynamic local control, achieved by Resource Holon. The Digital Twin (DT) concept is generally used to design CPS; it is virtual copies of the system that can interact with the physical counterparts in a bi-directional way. It seems to be promising to tackle the complexity and increase manufacturing system flexibility. In this paper, we use a DT Model to improve the SUDIHA architecture. We propose a Digital Twin based SUDIHA architecture (DT-SUDIHA). The paper will describe Digital Twins' configuration of each Holon of the SUDIHA Architecture, and the intelligent and real time data driven operation control of this architecture. A case study is carried out at the ENSAM-Meknes flexible workshop to prove the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
45. Simultaneous part input sequencing and robot scheduling for mass customisation.
- Author
-
He, Yumin and Stecke, Kathryn E.
- Subjects
SCHEDULING ,ROBOTS ,FLEXIBLE manufacturing systems ,PROBLEM solving - Abstract
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]
- Published
- 2022
- Full Text
- View/download PDF
46. Handling Transients of Dynamic Real-Time Workload Under EDF Scheduling.
- Author
-
Casini, Daniel, Biondi, Alessandro, and Buttazzo, Giorgio
- Subjects
SCHEDULING ,TRANSIENT analysis - Abstract
Real-time dynamic workload consists of tasks that can arbitrarily join and leave the system at run-time. To avoid incurring deadline misses, tasks that request to join the system must pass an admission test, which has to cope with potential scheduling transients originated by the residual effect of the tasks that previously left the system. This phenomenon may require some tasks to suffer an admission delay before being accepted for execution. This paper focuses on uniprocessor earliest-deadline first (EDF) scheduling with constrained deadlines and explicitly considers methods for handling scheduling transients in the presence of dynamic real-time workload. A generalized analysis framework is first presented to overcome several limitations of the existing approaches (including the support for overlapping transients), and is then used to derive methods for computing bounds on the admission delays incurred by tasks. Building on such results, an on-line protocol is proposed to handle the admission control of a dynamic workload, which also comes with a variant that can execute in polynomial time to favor its practical application. Furthermore, the paper shows how the presented analysis can be used off-line for analyzing mode-changes among static task sets. Experimental results are finally presented to evaluate the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
47. A switching mechanism framework for optimal coupling of predictive scheduling and reactive control in manufacturing hybrid control architectures.
- Author
-
Jimenez, Jose-Fernando, Bekrar, Abdelghani, Trentesaux, Damien, and Leitão, Paulo
- Subjects
PRODUCTION scheduling ,SWITCHING theory ,MULTIAGENT systems ,KEY performance indicators (Management) ,PRODUCTION control - Abstract
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]
- Published
- 2016
- Full Text
- View/download PDF
48. Deep reinforcement learning for dynamic scheduling of energy-efficient automated guided vehicles
- Author
-
Zhang, Lixiang, Yan, Yan, and Hu, Yaoguang
- Published
- 2023
- Full Text
- View/download PDF
49. Online Scheduling for Dynamic VM Migration in Multicast Time-Sensitive Networks.
- Author
-
Yu, Qinghan, Wan, Hai, Zhao, Xibin, Gao, Yue, and Gu, Ming
- Abstract
With the development of hardware virtualization and cloud computing, modern industry has a tendency to upgrade from the traditional industrial networks to virtual machine (VM) based networks. To provide firm latency guarantees for control messages in these networks, the time-sensitive network (TSN) is a promising technology due to its determinacy for real-time applications. However, TSN faces the challenge of providing a rapid response to dynamic transmission requirement changes incurred by VM migrations. In this paper, we proposed an online scheduling approach to deal with dynamic VM migrations in multicast TSN. In this approach, we devise a novel online scheduling framework [minimal distance tree (MDT) construction - heuristic breadth first search] containing an offline scheduling phase and an online rescheduling phase. While the offline phase introduces a MDT to increase reusable scheduling results, the online phase proposes a heuristic scheduling approach to reuse the results of the offline phase as much as possible to accelerate the rescheduling process. Experiments show that our framework can provide a rapid response to dynamic VM migrations compared with the existing approaches where the amount of control data does not exceed 50% of the bandwidth. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
50. Evolutionary Multitasking With Dynamic Resource Allocating Strategy.
- Author
-
Gong, Maoguo, Tang, Zedong, Li, Hao, and Zhang, Jun
- Subjects
COMPUTER multitasking ,EVOLUTIONARY algorithms ,BENCHMARK problems (Computer science) ,RESOURCE allocation ,ONLINE algorithms ,ADAPTIVE control systems - Abstract
Evolutionary multitasking is a recently proposed paradigm to simultaneously solve multiple tasks using a single population. Most of the existing evolutionary multitasking algorithms treat all tasks equally and then assign the same amount of resources to each task. However, when the resources are limited, it is difficult for some tasks to converge to acceptable solutions. This paper aims at investigating the resource allocation in the multitasking environment to efficiently utilize the restrictive resources. In this paper, we design a novel multitask evolutionary algorithm with an online dynamic resource allocation strategy. Specifically, the proposed dynamic resource allocation strategy allocates resources to each task adaptively according to the requirements of tasks. We also design an adaptive method to control the resources invested into cross-domain searching. The proposed algorithm is able to allocate the computational resources dynamically according to the computational complexities of tasks. The experimental results demonstrate the superiority of the proposed method in comparison with the state-of-the-art algorithms on benchmark problems of multitask optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.