Dataset of metaheuristics for the flow shop scheduling problem with maintenance activities integrated. [PDF]
Data Brief, 2021 Branda A +3 more
europepmc +1 more source
Flexible automation and the loss of pooling synergy [PDF]
This paper focuses on the effects of flexible automation on the performance of a job shop. Flexible automated machines may significantly improve the delivery performance and the flow time of jobs.
Slomp, Jannes, Zee, Durk-Jouke van der
core +1 more source
Particle swarm optimization applied to job shop scheduling [PDF]
, 2007 In this project we have to apply the particle swarm optimization algorithm to job shop scheduling problem. Job shop scheduling is a combinatorial optimization problem where we have to arrange the jobs which may or may not be processed in every machine in
Dwivedi , Piyush, Vishal , Vivek
core
An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling. [PDF]
Comput Intell Neurosci, 2022 Meng X, Wang N, Liu J, Liu Q.
europepmc +1 more source
Collaborative variable neighborhood search for multi-objective distributed scheduling in two-stage hybrid flow shop with sequence-dependent setup times. [PDF]
Sci Rep, 2022 Cai J +5 more
europepmc +1 more source
Ingeniare: Revista Chilena de IngenieríaUn Flow Shop es un sistema de producción en el cual una serie de trabajos debe seguir un flujo unidireccional para ser procesada en varias estaciones de trabajo.
Manuel Eduardo García Jiménez +2 more
doaj
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
Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times [PDF]
, 2007 Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the
Leshchenko, Natalja, Sotskov, Yuri
core
A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
International Journal of Industrial Engineering and Production Research, 2014 Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time.
Nasim Nahavandi, Ebrahim Asadi Gangraj
doaj
An O(nlogn) algorithm for the two-machine flow shop problem with controllable machine speeds [PDF]
Production Planning;Scheduling;produktieleer ...
Hoesel, C.P.M. van
core +1 more source