Browse "Dept. of Industrial and Systems Engineering(산업및시스템공학과)" by Subject SEQUENCING PROBLEM

Showing results 1 to 5 of 5

1
A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints

Joo, Byung Jun; Kim, Yeong-Dae, JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.60, pp.572 - 582, 2009-04

2
Minimizing makespan on a two-machine re-entrant flowshop

Choi, SW; Kim, Yeong-Dae, JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.58, pp.972 - 981, 2007-07

3
Minimizing makespan on an m-machine re-entrant flowshop

Choi, Seong-Woo; Kim, Yeong-Dae, COMPUTERS & OPERATIONS RESEARCH, v.35, no.5, pp.1684 - 1696, 2008-05

4
Minimizing total tardiness on a two-machine re-entrant flowshop

Choi, Seong-Woo; Kim, Yeong-Dae, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.199, no.2, pp.375 - 384, 2009-12

5
Three-machine flow shop scheduling with overlapping waiting time constraints

Kim, Hyunjung; Lee, Jun-Ho, COMPUTERS & OPERATIONS RESEARCH, v.101, pp.93 - 102, 2019-01

rss_1.0 rss_2.0 atom_1.0