The job scheduling problem is a type of scheduling problem where a list of jobs and machines are given. A solution consists of a schedule where each job is assigned to one or multiple machines at a certain time. In this study, a multiobjective evolutionary algorithm called NSGA-II was applied to optimize schedules for a particular scheduling problem given by a board game made by the Swedish educative company INSU. The scheduling problem features novel restrictions on the schedules, such as transportation delay between the jobs, skill requirements for the machines to fulfill. The board game also allows pre-emption, i.e., that the jobs can be paused and resumed by the same or other machines. These restrictions impose a challenge for creating ...
The Job Shop scheduling problem is widely used in industry and has been the subject of study by seve...
Job shop scheduling problem is one of the most difficult NP-hard combinatorial optimization problems...
The efforts of finding optimal schedules for the job shop scheduling problems are highly important f...
The job scheduling problem is a type of scheduling problem where a list of jobs and machines are giv...
[[abstract]]Over time, the traditional single-objective job shop scheduling method has grown increas...
This work proposes the impact assessment of the workers in the optimal time of operations in a Flexi...
In this study, the job shop scheduling problem is analysed with respect to numerous objectives, and ...
A job shop can be seen as a multi-operation model where jobs follows fixed routes, but not necessari...
A flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an...
Genetic algorithms are a very popular heuristic which have been suc-cessfully applied to many optimi...
International audienceThis paper deals with a general job shop scheduling problem with multiple cons...
In this paper, a novel evolutionary algorithm is applied to tackle job-shop scheduling tasks in manu...
Abstract: Problem statement: The problem of scheduling n jobs on m machines with each job having spe...
This paper addresses the flexible-job-shop scheduling problem (FJSP) with the objective of minimisin...
The Distributed and Flexible Job-shop Scheduling problem (DFJS) considers the scheduling of distribu...
The Job Shop scheduling problem is widely used in industry and has been the subject of study by seve...
Job shop scheduling problem is one of the most difficult NP-hard combinatorial optimization problems...
The efforts of finding optimal schedules for the job shop scheduling problems are highly important f...
The job scheduling problem is a type of scheduling problem where a list of jobs and machines are giv...
[[abstract]]Over time, the traditional single-objective job shop scheduling method has grown increas...
This work proposes the impact assessment of the workers in the optimal time of operations in a Flexi...
In this study, the job shop scheduling problem is analysed with respect to numerous objectives, and ...
A job shop can be seen as a multi-operation model where jobs follows fixed routes, but not necessari...
A flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an...
Genetic algorithms are a very popular heuristic which have been suc-cessfully applied to many optimi...
International audienceThis paper deals with a general job shop scheduling problem with multiple cons...
In this paper, a novel evolutionary algorithm is applied to tackle job-shop scheduling tasks in manu...
Abstract: Problem statement: The problem of scheduling n jobs on m machines with each job having spe...
This paper addresses the flexible-job-shop scheduling problem (FJSP) with the objective of minimisin...
The Distributed and Flexible Job-shop Scheduling problem (DFJS) considers the scheduling of distribu...
The Job Shop scheduling problem is widely used in industry and has been the subject of study by seve...
Job shop scheduling problem is one of the most difficult NP-hard combinatorial optimization problems...
The efforts of finding optimal schedules for the job shop scheduling problems are highly important f...