Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem

Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times

(2016) Xin Feng et al.   INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

Minimizing the total completion time in a two-machine flowshop problem with time delays

(2015) Mohamed Kais Msakni et al.   ENGINEERING OPTIMIZATION

Robust makespan minimisation in identical parallel machine scheduling problem with interval data

(2013) Xiaoqing Xu et al.   INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

The two stage assembly flowshop scheduling problem to minimize total tardiness

(2013) Ali Allahverdi et al.   JOURNAL OF INTELLIGENT MANUFACTURING

A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem

(2011) Yan-Feng Liu et al.   APPLIED SOFT COMPUTING

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

(2011) M. Fatih Tasgetiren et al.   INFORMATION SCIENCES

A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem

(2010) Hongcheng Liu et al.   EXPERT SYSTEMS WITH APPLICATIONS

A hybrid genetic local search algorithm for the permutation flowshop scheduling problem

(2008) Lin-Yu Tseng et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion

(2007) Adam Kasperski et al.   OPERATIONS RESEARCH LETTERS