Results 241 to 250 of about 2,312,652 (293)

A genetic algorithm for the Flexible Job-shop Scheduling Problem

Computers and 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.
Gianluca Morganti
exaly   +4 more sources

Survey of integrated flexible job shop scheduling problems

Computers and Industrial Engineering, 2022
Wenxiang Xu, Zhengchao Liu, Xixing Li
exaly   +3 more sources

Optimal scheduling for flexible job shop operation

International Journal of Production Research, 2005
This paper presents a new integer linear programming (ILP) model to schedule flexible job shop, discrete parts manufacturing industries that operate on a make-to-order basis. The model considers groups of parallel homogeneous machines, limited intermediate buffers and negligible set-up effects.
M.C. Gomes *   +2 more
exaly   +2 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 0002   +3 more
openaire   +2 more sources

Flexible job shop scheduling with blockages

Mathematical Methods of Operations Research, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ronny S. Hansmann   +2 more
openaire   +2 more sources

A genetic algorithm for flexible job-shop scheduling

Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C), 2003
Genetic algorithms have been applied to the scheduling of job shops-a class of very complicated combinatorial optimization problems. Among these algorithms for job shops, a common assumption is that the routes that jobs visit machines are fixed, this is not true for flexible job shops such as flexible manufacturing systems, where jobs have machine ...
Haoxun Chen   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy