A Case Study: Using Genetic Algorithm for Job Scheduling Problem
Nowadays, DevOps pipelines of huge projects are getting more and more complex. Each job in the pipeline might need different requirements including specific hardware specifications and dependencies. To achieve minimal makespan, developers always apply as much machines as possible. Consequently, others may be stalled for waiting resource released. Minimizing the makespan of each job using a few resource is a challenging problem. In this study, it is aimed to 1) automatically determine the priority of jobs to reduce the waiting time in the line, 2) automatically allocate the machine resource to each job. In this work, the problem is formulated as a multi-objective optimization problem. We use GA algorithm to automatically determine job priorities and resource demand for minimizing individual makespan and resource usage. Finally, the experimental results show that our proposed priority list generation algorithm is more effective than current priority list producing method in the aspects of makespan and allocated machine count.
Code (0)
등록된 구현이 없습니다.
Tasks
SchedulingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A batching and scheduling optimisation for a cutting work-center: Acta-Mobilier case study
The purpose of this study is to investigate an approach to group lots in batches and to schedule these batches on Acta-Mobilier cutting work-center while taking into account numerous constraints and objectives. The speci…
ManagementSchedulingOptimization of Worker Scheduling at Logistics Depots Using Genetic Algorithms and Simulated Annealing
This paper addresses the optimization of scheduling for workers at a logistics depot using a combination of genetic algorithm and simulated annealing algorithm. The efficient scheduling of permanent and temporary workers…
SchedulingA Sport Tournament Scheduling by Genetic Algorithm with Swapping Method
A sport tournament problem is considered the Traveling Tournament Problem (TTP). One interesting type is the mirrored Traveling Tournament Problem (mTTP). The objective of the problem is to minimize either the total numb…
SchedulingQuantum-Inspired Genetic Optimization for Patient Scheduling in Radiation Oncology
Among the genetic algorithms generally used for optimization problems in the recent decades, quantum-inspired variants are known for fast and high-fitness convergence and small resource requirement. Here the application …
SchedulingA biased random-key genetic algorithm for the home health care problem
Home health care problems consist of scheduling visits to home patients by health professionals while following a series of requirements. This paper studies the Home Health Care Routing and Scheduling Problem, which comp…
AttributeScheduling