Results 261 to 270 of about 62,078 (294)
Some of the next articles are maybe not open access.
Adaptive multimeme algorithm for flexible job shop scheduling problem
Natural Computing, 2016In this paper, we propose an adaptive multimeme algorithm (AMMA) to address the flexible job shop scheduling problem (FJSP) with the objective to minimize the makespan. The search operator is modeled as a synergy of genetic and memetic mechanisms through integrating a stochastic variation and a local search procedure into a composite operator for each ...
Zuo, Yi, Gong, Maoguo, Jiao, Licheng
openaire +1 more source
Reactive scheduling approach for solving a realistic flexible job shop scheduling problem
International Journal of Production Research, 2020Reactive Scheduling (RS) and the realistic Flexible Job Shop Scheduling Problem (FJSSP) are of major importance for the implementation of real-world manufacturing systems.
B. Mihoubi, B. Bouzouia, M. Gaham
openaire +1 more source
Bottleneck Identification of Extended Flexible Job Shop Scheduling Problem
2018 6th International Symposium on Computational and Business Intelligence (ISCBI), 2018In the Extended Flexible Job Shop Scheduling Problem (EFJSP), the temporal constraints among the tasks could be very complex including serial, parallel and flexible relations. This paper presents a method for identifying the critical tasks that affect the makespan most remarkably, which we call the "bottleneck tasks". To this end, we first transfer the
Yunfei Wang +5 more
openaire +1 more source
Simultaneous Scheduling Strategy: A Novel Method for Flexible Job Shop Scheduling Problem
2020 IEEE Congress on Evolutionary Computation (CEC), 2020This paper discussed the contradictory between wait time for computation and solution quality in solving flexible job shop scheduling problems. In order to reconcile this contradictory, a novel scheduling strategy called Simultaneous Scheduling is proposed.
Bo Liu, Siqi Qiu, Ming Li
openaire +1 more source
Genetic algorithm for the flexible job-shop scheduling problem
SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483), 2004In this paper, we are interested in the multiobjective optimization of the schedule performance in the flexible job shops. The flexible job shop scheduling problem (FJSP) is known in the literature as one of the hardest combinatorial optimization problems and presents many objectives to be optimized.
openaire +1 more source
MULTI OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEMS
2013Flexible job shop scheduling problem, is an extension of the classical job shop scheduling problem. In Flexible job shop scheduling problem, there are more than one machine with the same features for the same purpose. The problem can be defined as appointing the jobs to the machines (assignment) and ordering the jobs at each machine (sequencing) to ...
KAYA, Serkan, FIĞLALI, Nilgün
openaire +2 more sources
Scheduling Optimization of Flexible Job Shop Problem
2023 IEEE 7th Information Technology and Mechatronics Engineering Conference (ITOEC), 2023Gu Chan, Zou Di
openaire +1 more source
Survey of integrated flexible job shop scheduling problems
Computers & Industrial Engineering, 2022Xixing Li +8 more
openaire +1 more source
Flexible job shop scheduling problem with iterative combinatorial auctions
2016This thesis puts forth an algorithm for solving the flexible job shop scheduling problem. The algorithm consist of a subgradient search and of a list scheduling heuristic, which is designed to generate feasible solutions deriving from the infeasible solutions we obtain from the subgradient search.
openaire +1 more source
A hybrid genetic tabu search algorithm for distributed flexible job shop scheduling problems
Journal of Manufacturing Systems, 2023Xin-Yu Li, Liang Gao, Lin Gui
exaly