Results 31 to 40 of about 66,379 (340)

A chaotic simulated annealing and particle swarm improved artificial immune algorithm for flexible job shop scheduling problem

open access: yesEURASIP Journal on Wireless Communications and Networking, 2018
Reasonable scheduling of flexible job shop is key to improve production efficiency and economic benefits; in order to solve the problem in flexible job shop scheduling problem, a novel flexible job shop scheduling method based on improved artificial ...
Rui Zeng, Yingyan Wang
doaj   +1 more source

Flexible Job-Shop Scheduling with Batching for Semiconductor Manufacturing [PDF]

open access: green, 2015
International audienceScheduling decisions in the diffusion and cleaning area of a semiconductor manufacturing facilityhave an important impact on the overall performance of a plant.
Sebastian Knopp   +2 more
openalex   +3 more sources

Review on flexible job shop scheduling

open access: yesIET Collaborative Intelligent Manufacturing, 2019
Flexible job shop scheduling problem (FJSP) is an NP‐hard combinatorial optimisation problem, which has significant applications in the real world. Due to its complexity and significance, lots of attentions have been paid to tackle this problem. In this study, the existing solution methods for the FJSP in recent literature are classified into exact ...
Jin Xie   +4 more
openaire   +2 more sources

An investigation into minimising total energy consumption and total completion time in a flexible job shop for recycling carbon fiber reinforced polymer [PDF]

open access: yes, 2015
The increased use of carbon fiber reinforced polymer (CFRP) in industry coupled with European Union restrictions on landfill disposal has resulted in a need to develop relevant recycling technologies.
Liu, Ying, Tiwari, Ashutosh
core   +1 more source

A MILP model for an extended version of the Flexible Job Shop Problem [PDF]

open access: yes, 2014
A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order.
Birgin, Ernesto G.   +5 more
core   +2 more sources

An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem

open access: yesAlgorithms, 2015
The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence
Kong Lu   +5 more
doaj   +1 more source

Multi-Objective Flexible Job Shop Scheduling Using Genetic Algorithms [PDF]

open access: yes, 2022
Flexible Job Shop Scheduling is an important problem in the fields of combinatorial optimization and production management. This research addresses multi-objective flexible job shop scheduling problem with the objective of simultaneous minimization of ...
Aichouni, Mohamed   +5 more
core   +2 more sources

Research on Many-Objective Flexible Job Shop Intelligent Scheduling Problem Based on Improved NSGA-III

open access: yesIEEE Access, 2020
With the development of intelligent manufacturing and the customized product demand of customers, manufacturing enterprises are urgently required to carry out high-efficiency, high-quality, flexibility and low-cost manufacturing to enhance the ...
Yanwei Sang, Jianping Tan, Wen Liu
doaj   +1 more source

A FJSSP Method Based on Dynamic Multi-Objective Squirrel Search Algorithm

open access: yesInternational Journal of Antennas and Propagation, 2021
This paper comprehensively analyzes the characteristics of flexible job shop scheduling problem (FJSSP), takes the dynamic factors in the actual scheduling process such as the arrival and departure of jobs, the breakdown and recovery of machines into ...
Yanjiao Wang, Jieru Han
doaj   +1 more source

Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs [PDF]

open access: yesProduction and Operations Management, 2021
A common assumption in the shop scheduling literature is that the processing order of the operations of each job is sequential; however, in practice, there can be multiple connections and finish‐to‐start dependencies among the operations of each job. This paper studies flexible job shop scheduling problems with arbitrary precedence graphs.
Kasapidis, G. A.   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy