Results 21 to 30 of about 3,286,488 (310)
A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs [PDF]
Job precedence can often be seen in various manufacturing process scenarios. For instance, in the context of flow shop scheduling, certain jobs must be processed before a specific job may be executed.
M. Thangaraj +2 more
doaj +1 more source
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage ...
Raviteja Buddala, Siba Sankar Mahapatra
doaj +1 more source
The single factory production is shifting to multi-factory production which brings new challenges. Hybrid flow shop problem (HFSP) as a common problem in production-manufacturing has been studied extensively, however distributed hybrid flow shop problem (
Lei Wang, Dongdong Li
doaj +1 more source
Against the backdrop of mass customization, research interest in hybrid flow shop scheduling for standard and customized part production has been on the rise.
Xinye Liu, Hongfeng Wang, Chenxi Tang
doaj +1 more source
Analysis of dispatching rules application on scheduling problem in flexible-flow shop production [PDF]
In this paper we analyzed a group of simple heuristic methods, which are used for solving the scheduling problem in manufacturing and services. The analysis was performed on the scheduling problem in a flexible-flow shop production, which is known by the
Rakićević Zoran M. +1 more
doaj +1 more source
Open shop scheduling problems have many practical applications, in which the jobs can be in any order with the only restriction that their durations do not overlap with each other. In some cases, the order of a subset of jobs dictates the flow shop model
Guanqun Ni, Lei Chen
doaj +1 more source
Application of genetic algorithm to industrial scheduling and problems of parameters evaluation
Genetic algorithms are widely used in various mathematical and real world problems. They are approximate metaheuristic algorithms, commonly used for solving NP-hard problems in combinatorial optimisation.
Edgaras Šakurovas +1 more
doaj +1 more source
Stochastic-2-m-reentrant-flow-shop-scheduling-instances
Data instances for "robust scheduling in a two-machine re-entrant ow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian Activity Networks and phase-type distributions."
Lei Liu (14679124)
core +1 more source
Application of job shop scheduling approach in green patient flow optimization using a hybrid swarm intelligence. [PDF]
With the increasing demand for hospital services amidst the COVID-19 pandemic, allocation of limited public resources and management of healthcare services are of paramount importance.
Chaussalet, Thierry J +3 more
core +1 more source
Analysis of usage of genetic and tabu search algorithms in shop scheduling
A wide area of scheduling problem is industrial so-called shop scheduling (Job Shop, Flow Shop and Open Shop) which has important applications in real world industrial problems.
Edgaras Šakurovas +1 more
doaj +1 more source

