Results 111 to 120 of about 926 (160)

Dynamic job shop scheduling under multiple order disturbances using deep reinforcement learning. [PDF]

Sci Prog
Sun Z, Han W, Gao L, Zhu C, Lyu Q.
europepmc   +1 more source

A multi-objective brain storm optimization for integrated distributed flexible job shop and distribution problems. [PDF]

Heliyon
Jia Y, Zhou Y, Fu Y.
europepmc   +1 more source

Multicriteria scheduling of two-subassembly products with batch availability and precedence constraints. [PDF]

PeerJ Comput Sci
Wen Z, Li S.
europepmc   +1 more source

Centralized scheduling, decentralized scheduling or demand scheduling? How to more effectively allocate and recycle shared takeout lunch boxes. [PDF]

PLoS One
Bai Y, Liu D, Ma J.
europepmc   +1 more source

A robot scheduling method based on rMAPPO for H-beam riveting and welding work cell. [PDF]

PLoS One
Zheng J, Zhou C, Gao Y, Chen Z, Gao Y, Zhang Y, Zhou X, Ou Y.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A genetic algorithm for the Flexible Job-shop Scheduling Problem

Computers & Operations Research, 2008
In this paper a genetic algorithm for the flexible job-shop scheduling problem is presented. Given are a set of machines and a set of jobs consisting of operations which have to be sequenced in a fixed order. Each operation can be processed by a subset of the machines and its processing time depends on the assigned machine.
Pezzella, F., Morganti, G., Ciaschetti, G.   +2 more
openaire   +4 more sources

The generalized flexible job shop scheduling problem

Computers & Industrial Engineering, 2021
Abstract In this work, we introduce a generalized flexible job-shop scheduling problem in which, besides the classical constraints of the flexible job shop scheduling problem other hard constraints such as machine capacity, time lags, holding times, and sequence-dependent setup times are taken into account.
Vincent Boyer, Jobish Vallikavungal, Xavier Cantú Rodríguez, M. Angélica Salazar-Aguilar   +3 more
openaire   +1 more source

Flexible Job-Shop Scheduling Problems

2003
The Job-shop Scheduling Problem (JSP) is one of hardest problems; it is classified NP-complete (Carlier & Chretienne, 1988; Garey & Johnson, 1979). In the most part of cases, the combination of goals and resources can exponentially increase the problem complexity, because we have a very large search space and precedence constraints between ...
Kacem, Imed, Hammadi, Slim, Borne, Pierre   +2 more
openaire   +3 more sources

Scheduling complex flexible job shop problems

Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95, 2002
We are developing for some years scheduling softwares for chemical industry. These softwares (developed on C++) are based on heuristics combined with optimisation methods. Our aim is to design a general methodology to cope with a large class of flexible job shop problems.
H. El Maqrini, J. Teghem
openaire   +1 more source

Flexible job‐shop scheduling problem by genetic algorithm

Electrical Engineering in Japan, 2009
AbstractThe Flexible Job‐shop Scheduling Problem is an expansion of the traditional Job‐shop Scheduling Problem in which an operation can be processed by one or more machines. The purpose of this problem is to look for the smallest makespan. For that purpose, it is necessary to decide the optimal assignment of machines to operations and the order of ...
Kenichi Ida, Kensaku Oka
openaire   +1 more source