Efficient greedy algorithms for economic manpower shift planning (original) (raw)

Metaheuristics for the selection and scheduling of jobs with time-dependent durations

2017

A scheduling problem that determines an optimal sequence of jobs to be performed on a single machine is considered. A set of available jobs is presented to management of which a subset should be selected to maximise the total weighted profit. This is because of the schedule horizon that is limited to a maximum makespan, resulting in a pool of rejected jobs that may possibly be processed at a later stage. Each job is associated with a list of possible fractions that it requires of the machine during its processing. As a result, jobs can be processed simultaneously on the machine. Furthermore, once a job has completed its processing, there is a likelihood that the machine needs to be cleaned up and prepared for the following jobs to be processed. Setup times and setup costs are therefore associated with each ordered pair of jobs. Additionally, the processing time of a job depends on the time at which it starts processing. Lastly, certain jobs are prohibited from starting its processin...

Metaheuristic algorithms for the flexible job-shop scheduling problem

IMK-14 - Istrazivanje i razvoj, 2020

The problem with flexible job planning (FJSP) is a modification o f the classic job booking problem. This paper deals with the problem o f flexible job deployment and processing o f operations on one machine from a set o f alternative machines. The problem o f deploying flexible jobs in real time is one o f a group o f difficult NP problems (Non-deterministic polynomial time). The motive o f this paper is to show the application o f meta-heuristic algorithms on the example of flexible job schedules and present the appropriate method to future studies. To solve this problem, two meta-heuristic algorithms were used: Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC). The aim o f the paper is to achieve the speed o f the conversion solution in a series o f iterations, minimizing the total time o f deployment of jobs on an alternative set of machines, as well as minimizing the total schedule time. The problem o f deploying flexible jobs has great application, and with thi...

Hybrid metaheuristic to solve job sequencing problem

Indonesian Journal of Electrical Engineering and Computer Science, 2022

In this article, the job shop scheduling problem was solved, which is considered as an NP-Hard problem, so it is difficult to solve. The proposed algorithm consists in the combination and adaptation of the nearest neighbor metaheuristics and iterated local search (ILS) to find optimal solutions. The proposed algorithm was evaluated by comparing the results with those presented in different instances and sizes of the literature. The results of the proposed method were close in high percentages to the best results and averages obtained by other methods in the literature and in some cases, they were improved. The above represents the feasibility of a new combination of efficient methods in solving task scheduling problems.

Meta-Heuristic Procedure to Find the Solution of Job Shop Sceduling Problem

2020

In most production environment, there is a requirement for effective use of the available resources. Job Shop Scheduling Problem (JSSP) because of its key impact on revenues is at the crux of production planning, of late also known as Enterprise Resource Planning (ERP). Industrial tasks ranging from assembling cars to scheduling airplane maintenance crews are easily modeled as instances of JSSP, and improving solutions by even as little as one percent can have a significant financial impact. Efforts have been put to find not necessarily an optimal solution, but a good one to solve these problems. Tabu Search (TS) is an effective local search algorithm for the JSSP, but the quality of the best solution found depends on the initial solution used. The motivation behind such a paper is to layout critical discussion on the Tabu Search technique for JSSP, based on neighborhood structures for finding initial solutions, in order to better serve the needs of manufacturing community trying to...