An O ( n log n ) algorithm for the two-machine ow shop problem with controllable machine speeds [PDF]
In this paper we consider the two-machine ow shop problem with varying machine speeds. We present an algorithm which determines the optimal permutations for all machine speeds in O ( n log n ) time, where n is the number of jobs. To achieve this bound on
Hoesel,C.P.M.,van +2 more
core +1 more source
Evaluating Bio-Inspired Metaheuristics for Dynamic Surgical Scheduling: A Resilient Three-Stage Flow Shop Model Under Stochastic Emergency Arrivals. [PDF]
Becerra-Rozas M +8 more
europepmc +1 more source
An improved artificial bee colony algorithm with path relinking strategy for the integrated distributed no-wait flow-shop scheduling and vehicle routing problem. [PDF]
Dong C, Zhang H.
europepmc +1 more source
Solving multi-scenario hybrid flow shop scheduling problem based on an improved probe machine model. [PDF]
Tian X, Kong Y, Liu X.
europepmc +1 more source
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times. [PDF]
Ćwik M, Józefczyk J.
europepmc +1 more source
A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems. [PDF]
Khurshid B +4 more
europepmc +1 more source
Virtual Simulation-Based Optimization for Assembly Flow Shop Scheduling Using Migratory Bird Algorithm. [PDF]
Zhao WB, Hu JH, Tang ZQ.
europepmc +1 more source
Discrete bat algorithm for optimal problem of permutation flow shop scheduling. [PDF]
Luo Q, Zhou Y, Xie J, Ma M, Li L.
europepmc +1 more source
Two hybrid flow shop scheduling lines with assembly stage and compatibility constraints. [PDF]
Muñoz-Sánchez R +3 more
europepmc +1 more source
A multipopulation PSO based memetic algorithm for permutation flow shop scheduling. [PDF]
Liu R, Ma C, Ma W, Li Y.
europepmc +1 more source

