Flexible job shop scheduling

Part 1 book "Scheduling - Theory, algorithms, and systems" includes content: Introduction, deterministic models - preliminaries, single machine models (deterministic), advanced single machine models (deterministic), parallel machine models (deterministic), flow shops and flexible flow shops (deterministic), job shops (deterministic), open shops (deterministic), stochastic models - preliminaries, single machine models (stochastic), single machine models with release dates (stochastic).

323p muasambanhan03 02-01-2024 5 2   Download

The joint interaction of those two components yields a very efficient procedure for solving the FJSSP. An important step in the development of the algorithm was the selection of the right MOEA. Candidates were tested on problems of low, medium and high complexity. Further analyses showed the relevance of the search algorithm in the hybrid structure.

12p toritori 11-05-2020 15 0   Download

The published papers are classified into two categories. First is the FFS system characteristics and constraints including the problem differences and limitation defined by different studies. Second, the scheduling performances evaluation are elaborated and categorized into time, job and multi related objectives. In addition, the resolution approaches that have been used to solve FFS scheduling problems are discussed. This paper gives a comprehensive guide for the reader with respect to future research work on the FFS scheduling problem.

22p toritori 11-05-2020 9 0   Download

This paper uses game theory to propose a new worker assignment rule for DRC job shops. The Gale-Shapley model (also known as the stable marriage problem) forms a ‘couple’ made up of a worker and machine following a periodic review strategy. Simulation is used to evaluate and compare the proposed model to “when” and “where” rules previously proposed in the literature

12p toritori 11-05-2020 19 0   Download