A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems

Chia-Shin Chung; James Flynn; Omer Kirca

doi:10.1016/s0925-5273(02)00234-7

A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems

International Journal of Production Economics ◽

10.1016/s0925-5273(02)00234-7 ◽

2002 ◽

Vol 79 (3) ◽

pp. 185-196 ◽

Cited By ~ 50

Author(s):

Chia-Shin Chung ◽

James Flynn ◽

Omer Kirca

Keyword(s):

Branch And Bound ◽

Flow Time ◽

Branch And Bound Algorithm ◽

Total Flow ◽

Permutation Flowshop ◽

Total Flow Time

Download Full-text

A branch-and-bound algorithm to minimize total flow time with unequal release dates

Naval Research Logistics (NRL) ◽

10.1002/1520-6750(199210)39:6<859::aid-nav3220390610>3.0.co;2-w ◽

1992 ◽

Vol 39 (6) ◽

pp. 859-875 ◽

Cited By ~ 55

Author(s):

Chengbin Chu

Keyword(s):

Branch And Bound ◽

Flow Time ◽

Branch And Bound Algorithm ◽

Release Dates ◽

Total Flow ◽

Total Flow Time

Download Full-text

A Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion

Parallel Problem Solving from Nature – PPSN XIII - Lecture Notes in Computer Science ◽

10.1007/978-3-319-10762-2_16 ◽

2014 ◽

pp. 161-170 ◽

Cited By ~ 15

Author(s):

Valentino Santucci ◽

Marco Baioletti ◽

Alfredo Milani

Keyword(s):

Differential Evolution ◽

Differential Evolution Algorithm ◽

Flow Time ◽

Scheduling Problem ◽

Flowshop Scheduling ◽

Total Flow ◽

Permutation Flowshop ◽

Total Flow Time ◽

Evolution Algorithm ◽

Flowshop Scheduling Problem

Download Full-text

Local Optima Networks of the Permutation Flowshop Scheduling Problem: Makespan vs. total flow time

2017 IEEE Congress on Evolutionary Computation (CEC) ◽

10.1109/cec.2017.7969541 ◽

2017 ◽

Cited By ~ 6

Author(s):

Leticia Hernando ◽

Fabio Daolio ◽

Nadarajen Veerapen ◽

Gabriela Ochoa

Keyword(s):

Flow Time ◽

Scheduling Problem ◽

Flowshop Scheduling ◽

Total Flow ◽

Permutation Flowshop ◽

Local Optima ◽

Total Flow Time ◽

Local Optima Networks ◽

Flowshop Scheduling Problem

Download Full-text

A Discrete Artificial Bee Colony for Distributed Permutation Flowshop Scheduling Problem with Total Flow Time Minimization

2018 37th Chinese Control Conference (CCC) ◽

10.23919/chicc.2018.8482716 ◽

2018 ◽

Cited By ~ 3

Author(s):

Jia-Qi Pan ◽

Wen-Qiang Zou ◽

Jun-Hua Duan

Keyword(s):

Artificial Bee Colony ◽

Flow Time ◽

Scheduling Problem ◽

Flowshop Scheduling ◽

Total Flow ◽

Permutation Flowshop ◽

Total Flow Time ◽

Bee Colony ◽

Time Minimization ◽

Flowshop Scheduling Problem

Download Full-text

New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem

Computers & Operations Research ◽

10.1016/j.cor.2016.04.007 ◽

2016 ◽

Vol 74 ◽

pp. 165-174 ◽

Cited By ~ 16

Author(s):

Hamid Abedinnia ◽

Christoph H. Glock ◽

Andreas Brill

Keyword(s):

Heuristic Algorithms ◽

Flow Time ◽

Scheduling Problem ◽

Flowshop Scheduling ◽

Total Flow ◽

Permutation Flowshop ◽

Total Flow Time ◽

Constructive Heuristic ◽

Flowshop Scheduling Problem

Download Full-text

Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time

Intelligent Computing Methodologies - Lecture Notes in Computer Science ◽

10.1007/978-3-319-95957-3_79 ◽

2018 ◽

pp. 753-759 ◽

Cited By ~ 3

Author(s):

Hande Öztop ◽

M. Fatih Tasgetiren ◽

Deniz Türsel Eliiyi ◽

Quan-Ke Pan

Keyword(s):

Energy Consumption ◽

Flow Time ◽

Flowshop Scheduling ◽

Total Flow ◽

Permutation Flowshop ◽

Trade Off ◽

Total Flow Time

Download Full-text

A Branch-and-Bound Method to Minimize the Total Flow Time in a Permutation Flow Shop with Blocking and Setup Times

Production Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-76307-7_17 ◽

2021 ◽

pp. 217-232

Author(s):

João Vítor Silva Robazzi ◽

Marcelo Seido Nagano ◽

Mauricio Iwama Takano

Keyword(s):

Branch And Bound ◽

Flow Shop ◽

Flow Time ◽

Setup Times ◽

Branch And Bound Method ◽

Total Flow ◽

Total Flow Time ◽

Permutation Flow Shop

Download Full-text

Fitness Landscape Analysis of the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion

Computational Science and Its Applications – ICCSA 2017 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-62392-4_51 ◽

2017 ◽

pp. 705-716 ◽

Cited By ~ 1

Author(s):

Marco Baioletti ◽

Valentino Santucci

Keyword(s):

Fitness Landscape ◽

Flow Time ◽

Landscape Analysis ◽

Scheduling Problem ◽

Flowshop Scheduling ◽

Total Flow ◽

Permutation Flowshop ◽

Total Flow Time ◽

Time Criterion ◽

Flowshop Scheduling Problem

Download Full-text

A Novel Constructive Heuristic for Flowshop Group Scheduling Problems to Minimize Total Flow Time

10.23919/ccc52363.2021.9549650 ◽

2021 ◽

Author(s):

Xuan He ◽

Yu-Fan Liu ◽

Quan-Ke Pan ◽

Yang Yu ◽

Yuan-Zhen Li

Keyword(s):

Flow Time ◽

Group Scheduling ◽

Scheduling Problems ◽

Total Flow ◽

Total Flow Time ◽

Constructive Heuristic

Download Full-text

Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations

European Journal of Operational Research ◽

10.1016/j.ejor.2022.01.002 ◽

2022 ◽

Author(s):

Antonin Novak ◽

Andrzej Gnatowski ◽

Premysl Sucha

Keyword(s):

Parallel Machines ◽

Scheduling Algorithms ◽

Flow Time ◽

Total Flow ◽

Robust Scheduling ◽

Total Flow Time ◽

Time Minimization ◽

Distributionally Robust

Download Full-text