Results 71 to 80 of about 468,839 (205)

MODEL PENJADWALAN BACKWARD HYBRID FLOW SHOP 2 STAGE UNTUK MEMINIMASI MEAN FLOWTIME

open access: yesJurnal Lebesgue
The scheduling problem is a common challenge when it comes to executing tasks, making the resolution of this issue crucial for decision-making in production activities.
Asep Anwar   +2 more
doaj   +1 more source

New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria [PDF]

open access: yes, 2013
In this paper, we are interested in parallel identical machine scheduling problems with preemption and release dates in case of a regular criterion to be minimized.
Bellenguez-Morineau, O.   +2 more
core   +5 more sources

A hybrid job-shop scheduling system [PDF]

open access: yes
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

Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem [PDF]

open access: yes, 2009
The re-entrant flow shop environment has become prominent in the manufacturing industries and has recently attracted researchers attention. Typical examples of re-entrant flow shops are the printed circuit board manufacturing and furniture painting
Sh Ahmad, Sh Salleh
core  

Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem [PDF]

open access: yes, 2021
This paper proposes a heuristic that introduces the application of bottleneck-based concept at the beginning of an initial sequence determination with the objective of makespan minimization.
A. S., Zainudin   +3 more
core  

Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective [PDF]

open access: yes, 2019
In this paper we address the classical hybrid flow shop scheduling problem with makespan objective. As this problem is known to be NP-hard and a very common layout in real-life manufacturing scenarios, many studies have been proposed in the literature to
Fernández-Viagas Escudero, Víctor   +2 more
core  

Workload Control in Flow Shops with Bottleneck Shifting and Process Time Variability

open access: yesProduction Engineering Archives
Manufacturing industries struggle to devise precise planning and scheduling solutions due to unpredictable business situations. Additionally, uncertainties in production such as machine breakdowns, labour absenteeism, cycle time deviations, etc., would ...
Prabhu Aruna   +2 more
doaj   +1 more source

Non-permutation flow shop scheduling problem with preemption-dependent processing time

open access: yesCogent Engineering, 2016
In this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization
Mohsen Ziaee, Hossein Karimi
doaj   +1 more source

A Two-Stage Three-Machine Flow Shop Assembly Problem Mixed with a Controllable Number and Sum-of-Processing Times-Based Learning Effect by Simulated Annealing Algorithms

open access: yesDiscrete Dynamics in Nature and Society, 2020
The two-stage assembly scheduling problem is widely used in industrial and service industries. This study focuses on the two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect,
Shang-Chia Liu
doaj   +1 more source

Selected heuristic algorithms for solving job shop and flow shop scheduling problems [PDF]

open access: yes, 2014
Importance of job shop and flow shop scheduling has increased to a high extent. Nowadays, each and every industry focuses largely on how to schedule their machine working, since it is an important factor which decides the net productivity.
Das, M K
core  

Home - About - Disclaimer - Privacy