Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation

Two-machine flowshop scheduling with a secondary criterion

Computers and Operations Research

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

Journal of Heuristics

Lower bounds for minimizing total completion time in a two-machine flow shop

Journal of Scheduling

A combinatorial particle swarm optimisation for solving permutation flowshop problems

Computers and Industrial Engineering

Two machine flow shop scheduling problem with weighted WIP costs

Computers and Operations Research

An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

Computers and Operations Research

Flow shops with WIP and value added costs

Journal of Scheduling

A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Information Sciences: an International Journal

A matheuristic approach for the total completion time two-machines permutation flow shop problem

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization

A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

Mathematical and Computer Modelling: An International Journal

A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time

Computers and Operations Research