Sequencing CONWIP flow-shops: Analysis and heuristics [PDF]
In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CON\VIP production control system with the objective to minimise the make span We characterise the problem and analyse its similarities and differences with the ...
Framiúnan, Jose M. +2 more
core
Scheduling of Flexible Manufacturing Systems using Intelligent heuristic search algorithm (IHSA*) [PDF]
, 2012 The complete scheduling of FMS includes two independent processes: sequencing of jobs and scheduling those prioritized jobs. In a flow shop or a Progressive type FMS, scheduling problem involves sequencing of ‘n’ jobs on ‘m’ machines with minimum ...
Gidhi, Pradyumna Kumar
core
A hybrid job-shop scheduling system [PDF]
The intention of the scheduling system developed at the Fraunhofer-Institute for Material Flow and Logistics is the support of a scheduler working in a job-shop.
Bayat-Sarmadi, Fahid +3 more
core +1 more source
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics [PDF]
, 2018 This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the art is not clear due to partial
Fernández-Viagas Escudero, Víctor +2 more
core
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimize total flowtime [PDF]
, 2016 This paper focuses on the blocking flow shop scheduling problem with the objective of total flowtime minimisation. This problem assumes that there are no buffers between machines and, due to its application to many manufacturing sectors, it is receiving ...
Fernández-Viagas Escudero, Víctor +2 more
core +1 more source
Improve Algoritma Hodgson Untuk Meminimasi Jumlah Job Terlambat Pada Penjadwalan Flow shop
Jurnal Teknik Industri, 2018 Since Johnson published a paper in 1954, the problem of job scheduling has received the attention of hundreds of practitioners and researchers, as one of the most studied topics in Operation research.
Dian Setiya Widodo
doaj +1 more source
Resource Speed Optimization for Two-Stage Flow-Shop Scheduling [PDF]
, 2015 Multiple resource co-scheduling algorithms and pipelined execution models are becoming increasingly popular, as they better capture the heterogeneous nature of modern architectures.
Alessandra Melani +4 more
core
The Effectiveness of Genetic Algorithm, And the CDS Method In Solving Flowshop Scheduling Problems [PDF]
E3S Web of ConferencesFlow shop scheduling problem is considered NP-hard for m machines and n jobs. For such NP-hard combinatorial optimization problems, heuristics play a major role in searching for near-optimal solutions. In this paper we used Genetic Algorithm, and the CDS
Prassetiyo Hendro, Heryati Firda
doaj +1 more source
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations [PDF]
, 2019 In this paper, we address the hybrid flowshop scheduling problem for makespan minimisation. More specifically, we are interested in the special case where there are missing operations, i.e.
Dios, Manuel +2 more
core
A scheduling theory framework for GPU tasks efficient execution [PDF]
, 2018 Concurrent execution of tasks in GPUs can reduce the computation time of a workload by overlapping data transfer and execution commands.
A Allahverdi +11 more
core +2 more sources