Results 251 to 260 of about 2,035,483 (294)
Some of the next articles are maybe not open access.
Solving the Flexible Job Shop Problem on GPU
2012In this work we examine a model of flexible job shop problem in which for a given operation there is a possibility of a choice of the machine on which this operation will be carried out. This problem is a generalization of the classic job shop problem. We present a tabu search algorithm in which "a golf neighborhood" was applied.
Wojciech Bozejko +2 more
openaire +1 more source
Review for Flexible Job Shop Scheduling
2020Flexible Job shop Scheduling Problem (FJSP) is an NP-hard combinatorial optimization problem, which has significant applications in the real world. Due to the complexity and significance, lots of attention have been attracted to tackle this problem. In this paper, the existing solution methods for the FJSP in the recent literature are classified into ...
Xinyu Li, Liang Gao
openaire +1 more source
Total Tardiness in a Flexible Job-shop
The Proceedings of the Multiconference on "Computational Engineering in Systems Applications", 2006We propose in this paper different approaches for the flexible job shop scheduling problem. The chosen criterion is the total tardiness due to the importance of respecting the due dates in production process and in the whole supply chain. The first approach is based on the decomposition of the problem in an assignment problem and a sequencing problem ...
Nozha Zribi, Ab El Kamel, Pierre Borne
openaire +1 more source
Measuring flexibility of job-shop layouts
International Journal of Production Research, 1980It is generally agreed that flexibility in job-shop layouts is a desirable goal which must be planned for in a systematic fashion. Not generally available, however, are procedures by which alternate layout designs can be quantitatively evaluated with respect to the amount of flexibility a particular layout may possess.
DENNIS B. WEBSTER, MICHAEL B. TYBERGHEIN
openaire +1 more source
Flexible Job-Shop Scheduling Problems
2003The Job-shop Scheduling Problem (JSP) is one of hardest problems; it is classified NP-complete (Carlier & Chretienne, 1988; Garey & Johnson, 1979). In the most part of cases, the combination of goals and resources can exponentially increase the problem complexity, because we have a very large search space and precedence constraints between ...
Kacem, Imed +2 more
openaire +3 more sources
Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm
Journal of Intelligent Manufacturing, 2006Most flexible job shop scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines may be unavailable due to maintenances, pre-schedules and so on. In this paper, we study the flexible job shop scheduling problem with availability constraints.
Jie Gao 0007, Mitsuo Gen, Linyan Sun
openaire +1 more source
Heuristic approaches for scheduling jobs in large-scale flexible job shops
Computers & Operations Research, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oleh Sobeyko, Lars Mönch
openaire +3 more sources
Handling flexibility in a “generalised job shop” with a fuzzy approach
European Journal of Operational Research, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Minimizing Tardiness in Stochastic Flexible Job Shop Problem
2021In this paper, Flexible Job Shop Scheduling Problem (FJSP) with parallel batch processing machine is investigated. The problem is to find the best solution for assign jobs to machines and batch’s processing sequence to minimizing tardiness. First a Mixed Integer Programming (MIP) formulation is proposed for the first time.
Mahsa Nekouei-Shahraki +2 more
openaire +2 more sources
A heuristic to schedule flexible job-shop in a glass factory
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ramón Alvarez-Valdés +4 more
openaire +3 more sources