A common framework and taxonomy for multicriteria scheduling problems with Interfering and competing Jobs: Multi-agent scheduling problems

Most classical scheduling research assumes that the objectives sought are common to all jobs to be scheduled. However, many real-life applications can be modeled by considering different sets of jobs, each one with its own objective(s), and an increasing number of papers addressing these problems has appeared over the last few years. Since so far the area lacks a uni ed view, the studied problems have received different names (such as interfering jobs, multi-agent scheduling, mixed-criteria, etc), some authors do not seem to be aware of important contributions in related problems, and solution procedures are often developed without taking into account existing ones. Therefore, the topic is in need of a common framework that allows for a systematic recollection of existing contributions, as well as a clear de nition of the main research avenues. In this paper we review multicriteria scheduling problems involving two or more sets of jobs and propose an uni ed framework providing a common de nition, name and notation for these problems. Moreover, we systematically review and classify the existing contributions in terms of the complexity of the problems and the proposed solution procedures, discuss the main advances, and point out future research lines in the topic

A single-machine scheduling problem with multiple unavailability constraints: A mathematical model and an enhanced variable neighborhood search approach

AbstractThis research focuses on a scheduling problem with multiple unavailability periods and distinct due dates. The objective is to minimize the sum of maximum earliness and tardiness of jobs. In order to optimize the problem exactly a mathematical model is proposed. However due to computational difficulties for large instances of the considered problem a modified variable neighborhood search (VNS) is developed. In basic VNS, the searching process to achieve to global optimum or near global optimum solution is totally random, and it is known as one of the weaknesses of this algorithm. To tackle this weakness, a VNS algorithm is combined with a knowledge module. In the proposed VNS, knowledge module extracts the knowledge of good solution and save them in memory and feed it back to the algorithm during the search process. Computational results show that the proposed algorithm is efficient and effective

Competitive Two-Agent Scheduling with Learning Effect and Release Times on a Single Machine

The learning effect has gained much attention in the scheduling research recently, where many researchers have focused their problems on only one optimization. This study further addresses the scheduling problem in which two agents compete to perform their own jobs with release times on a common single machine with learning effect. The aim is to minimize the total weighted completion time of the first agent, subject to an upper bound on the maximum lateness of the second agent. We propose a branch-and-bound approach with several useful dominance properties and an effective lower bound for searching the optimal solution and three simulated-annealing algorithms for the near-optimal solutions. The computational results show that the proposed algorithms perform effectively and efficiently

Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem

High-speed railway is one of the most important ways to solve the long-standing travel difficulty problem in China. However, due to the high acquisition and maintenance cost, it is impossible for decision-making departments to purchase enough EMUs to satisfy the explosive travel demand. Therefore, there is an urgent need to study how to utilize EMU more efficiently and reduce costs in the case of completing a given task in train diagram. In this paper, an EMU circulation scheduling model is built based on train diagram constraints, maintenance constraints, and so forth; in the model solving process, an improved ACA algorithm has been designed. A case study is conducted to verify the feasibility of the model. Moreover, contrast tests have been carried out to compare the efficiency between the improved ACA and the traditional approaches. The results reveal that improved ACA method can solve the model with less time and the quality of each representative index is much better, which means that efficiency of the improved ACA method is higher and better scheduling scheme can be obtained

A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Cost Factor Focused Scheduling and Sequencing: A Neoteric Literature Review

The hastily emergent concern from researchers in the application of scheduling and sequencing has urged the necessity for analysis of the latest research growth to construct a new outline. This paper focuses on the literature on cost minimization as a primary aim in scheduling problems represented with less significance as a whole in the past literature reviews. The purpose of this paper is to have an intensive study to clarify the development of cost-based scheduling and sequencing (CSS) by reviewing the work published over several parameters for improving the understanding in this field. Various parameters, such as scheduling models, algorithms, industries, journals, publishers, publication year, authors, countries, constraints, objectives, uncertainties, computational time, and programming languages and optimization software packages are considered. In this research, the literature review of CSS is done for thirteen years (2010-2022). Although CSS research originated in manufacturing, it has been observed that CSS research publications also addressed case studies based on health, transportation, railway, airport, steel, textile, education, ship, petrochemical, inspection, and construction projects. A detailed evaluation of the literature is followed by significant information found in the study, literature analysis, gaps identification, constraints of work done, and opportunities in future research for the researchers and experts from the industries in CSS