Results 21 to 30 of about 8,566,720 (303)
Future Internet, 2017 This research combines between two different manufacturing concepts. On the one hand, flow shop scheduling is a well-known problem in production systems. The problem appears when a group of jobs shares the same processing sequence on two or more machines
Ahmed R. Sadik, Bodo Urban
doaj +1 more source
The Dominance Flow Shop Scheduling Problem
Electronic Notes in Discrete Mathematics, 2018 Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Centro Cientifico Tecnologico Conicet - Bahia Blanca. Instituto de Matematica Bahia Blanca. Universidad Nacional del Sur. Departamento de Matematica.
Daniel Alejandro Rossit +4 more
openaire +2 more sources
Алгоритмы приближенного решения многостадийных Flow-Shop-Problem
Sistemnì Doslìdženâ ta Informacìjnì Tehnologìï, 2019 Построение многостадийных расписаний выполнения заданий на расположенных в последовательную цепочку системах машин имеет много практических приложений в календарном планировании дискретного производства.
Yuriy A. Zack
doaj +1 more source
Constraint programing for solving four complex flexible shop scheduling problems
IET Collaborative Intelligent Manufacturing, 2021 In recent years, with the advent of robust solvers such as Cplex and Gurobi, constraint programing (CP) has been widely applied to a variety of scheduling problems.
Leilei Meng +7 more
doaj +1 more source
Journal of Industrial Engineering International, 2017 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
A combination of flow shop scheduling and the shortest path problem [PDF]
Journal of Combinatorial Optimization, 2013 18 pages, 5 ...
Kameng Nip +3 more
openaire +4 more sources
Approximation results for flow shop scheduling problems with machine availability constraints [PDF]
, 2009 This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing ...
Strusevich, Vitaly A. +2 more
core +1 more source
Solving Non-Permutation Flow Shop Scheduling Problem with Time Couplings
Applied Sciences, 2021 In this paper, a non-permutation variant of the Flow Shop Scheduling Problem with Time Couplings and makespan minimization is considered. Time couplings are defined as machine minimum and maximum idle time allowed.
Radosław Idzikowski +2 more
doaj +1 more source
A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs [PDF]
Journal of Project Management, 2022 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
MathematicsAgainst 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