Results 21 to 30 of about 226,189 (297)
An investigation into minimising total energy consumption and total completion time in a flexible job shop for recycling carbon fiber reinforced polymer [PDF]
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
Discrepancy search for the flexible job shop scheduling problem [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ben Hmida, Abir +3 more
openaire +2 more sources
A MILP model for an extended version of the Flexible Job Shop Problem [PDF]
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
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
Many-Objective Flexible Job Shop Scheduling Problem with Green Consideration
With the increasingly customized product requirements of customers, the manufactured products have the characteristics of multi-variety and small-batch production.
Yanwei Sang, Jianping Tan
doaj +1 more source
Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing. [PDF]
Flexible job-shop scheduling problems (FJSPs) represent one of the most complex combinatorial optimization challenges. Modern production systems and control processes demand rapid decision-making in scheduling. To address this challenge, we propose a quantum computing approach for solving FJSPs. We propose a quadratic unconstrained binary optimization (
Fu K, Liu J, Chen M, Zhang H.
europepmc +4 more sources
job shop scheduling problem:literature review
As an extension of the Job Shop Scheduling (JSP), Flexible job-shop Scheduling Problem (FJSP), can be defined as one of the most significant problems in up-to-date manufacturing systems, recently a lot of studies have been conducted to address FJSP ...
Marrwa Abd-AlKareem Alabajee +2 more
doaj +1 more source
With the popularization of multi-variety and small-batch production patterns, the flexible job shop scheduling problem (FJSSP) has been widely studied. The sharing of processing resources by multiple machines frequently occurs due to space constraints in
Zhen Chen +3 more
doaj +1 more source
Iterative Flattening Search for the Flexible Job Shop Scheduling Problem [PDF]
This paper presents a meta-heuristic algorithm for solving the Flexible Job Shop Scheduling Problem (FJSSP). This strategy, known as Iterative Flattening Search (IFS), iteratively applies a relaxation-step, in which a subset of scheduling decisions are ...
Albán, H. +9 more
core +1 more source
Flexible Job Shop Problem with Variable Machine Flexibility
Abstract We analyze machine flexibility in the context of the flexible job shop problem. In general, the decisions about machine flexibility are taken in advance (the data sets already contain this information). Based on a mathematical model from literature, we proposed an extension that, aiming to minimize the makespan, considers the possibility of ...
Silvio Alexandre de Araujo +1 more
openaire +1 more source

