The present paper introduces a learning-based optimization approach to the resource-constrained multi-project scheduling problem. Multiple projects, each with their own set of activities, need to be scheduled. The objectives dealt with here include minimization of the average project delay and total makespan. The availability of local and global resources, precedence relations between activities, and non-equal project start times have to be considered. The proposed approach relies on a simple sequence learning game played by a group of project managers. The project managers each learn their activity list locally using reinforcement learning, more specifically learning automata. Meanwhile, they learn how to choose a suitable place in the overall sequence of all activity lists. All the projects need to arrive at a unique place in this sequence. A mediator, who usually has to solve a complex optimization problem, now manages a simple dispersion game. Through the mediator, a sequence of feasible activity lists is eventually scheduled by using a serial schedule generation scheme, which is adopted from single project scheduling. It is shown that the sequence learning approach has a large positive effect on minimizing the average project delay. In fact, the combination of local reinforcement learning, the sequence learning game and a forward-backward implementation of the serial scheduler significantly improves the best known results for all the MPSPLIB datasets. In addition, several new best results were obtained for both considered objectives: minimizing the average project delay and minimizing the total makespan.

/pdf/a-learning-based-optimization-approach-to-multi-project-5ecupv64c5.pdf

A learning-based optimization approach to multi-project scheduling

Satisfying the clients' uncompromising priorities is a challenge for decision makers of organizations that face multiple projects. This paper considers an organization with a multi-skilled workforce working on several predetermined projects under time-of-use energy tariffs where distributed load energy usage is the primary concern of energy suppliers. This paper also considers different time-of-use energy tariffs, which are among the most common strategies to reach a more balanced energy utilization. The problem is stated as a bi-objective mixed-integer programming model containing two conflicting objectives; to minimize the total cost of the multi-skilled workforce and obtain a sustainable schedule with minimum deviation from the projects' priorities. The problem is formulated mathematically, and the GAMS solver is applied for justifying the conflict between the objectives and validating the proposed formulation. In order to tackle real-life instances of the problem, intelligent algorithms based on cuckoo search, particle swarm, and genetic algorithms are developed. In the proposed algorithms, the application of a well-designed encoding and decoding structure efficiently ensures the generated solutions' feasibility. The Taguchi method is used for calibrating the parameters of the proposed meta-heuristics. Performance of the solving methods is evaluated based on some experiments, where ELECTRE method is utilized as a decision-making technique to prioritize the developed algorithms. To this aim, some well-known multi-objective measures are applied for comparative analysis of the results, where the supremacy of FSCS in terms of all metrics is declared.

A bi-objective model for scheduling of multiple projects under multi-skilled workforce for distributed load energy usage

Most of the photo voltaic (PV) arrays often work in harsh outdoor environment, and undergo various faults, such as local material aging, shading, open circuit, short circuit and so on. The generation of these faults will reduce the power generation efficiency, and when a fault occurs in a PV model, the PV model and the systems connected to it are also damaged. In this paper, an on-line distributed monitoring system based on XBee wireless sensors network is designed to monitor the output current, voltage and irradiation of each PV module, and the temperature and the irradiation of the environment. A simulation PV module model is established, based on which some common faults are simulated and fault training samples are obtained. Finally, a memetic algorithm optimized Back Propagation ANN fault diagnosis model is built and trained by the fault samples data. Experiment result shows that the system can detect the common faults of PV array with high accuracy.

/pdf/dynamic-monitoring-and-optimization-of-fault-diagnosis-of-29qnwf30lf.pdf

Dynamic Monitoring and Optimization of Fault Diagnosis of Photo Voltaic Solar Power System Using ANN and Memetic Algorithm

A flexible integrated forward/reverse logistics model with random path M.Sc. Elham Behmanesh Doctor of Engineering Graduate Department of Production Engineering University of Bremen 2018 This dissertation focuses on the structure of a particular logistics network design problem, one that is a major strategic issue for supply chain design and management. Nowadays, the design of the supply chain network must allow for operation at the lowest cost, while providing the best customer service and accounting for environmental protection. Due to business and environmental issues, industrial players are under pressure to take back used products. Moreover, the significance of transportation costs and customer satisfaction spurs an interest in developing a flexible network design model. To this end, in this study, we attempt to include this reverse flow through an integrated design of a forward/reverse supply chain network design, that avoids the sub-optimal solutions derived from separated designs. We formulate a cyclic, seven-stage, logistics network problem as an NP-hard mixed integer linear programming (MILP) model. This integrated, multistage model is enriched by using a complete delivery graph in forward flow, which makes the problem more complex. As these kinds of problems belong to the category of NP-hard problems, traditional approaches fail to find an optimal solution in sufficiently short time. Furthermore, considering an integrated design and flexibility at the same time makes the logistics network problem even more complex, and makes it even less likely, if not impossible, for a traditional approach to provide solution within an acceptable time frame. Hence, researchers develop efficient non-traditional techniques for the large-term operation of the whole supply chain. These techniques provide near optimal solutions particularly for large scale test problems. In our case within this thesis, to find a near optimal solution, we apply

A flexible integrated forward/reverse logistics model with random path

In this chapter the Basic Multi-Project Scheduling Problem (BMPSP) is described, an overview of the literature on multi-project scheduling is provided, and a solution approach based on a biased random-key genetic algorithm (BRKGA) is presented. The BMPSP consists in finding a schedule for all the activities belonging to all the projects taking into account the precedence constraints and the availability of resources, while minimizing some measure of performance. The representation of the problem is based on random keys. The BRKGA generates priorities, delay times, and release dates, which are used by a heuristic decoder procedure to construct parameterized active schedules. The performance of the proposed approach is validated on a set of randomly generated problems.

/pdf/the-basic-multi-project-scheduling-problem-4wb2y5onio.pdf

The Basic Multi-Project Scheduling Problem

Multi-project Scheduling using a Heuristic and Memetic Alogrithm

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

S. Kumanam

Author Tools

Chat about Author

Papers

Multi-project Scheduling using a Heuristic and Memetic Alogrithm