Search

Start a new search
Current filters:
Add filters:
  • Results/Page
  • Sort items by
  • In order
  • Authors/record

Results 1-4 of 4 (Search time: 0.004 seconds).

NO Title, Author(s) (Publication Title, Volume Issue, Page, Issue Date)
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
Heuristics for search sequencing under time-dependent probabilities of existence

Lee, Ho-Joo; Kim, Yeong-Dae, COMPUTERS & OPERATIONS RESEARCH, v.34, no.7, pp.2010 - 2024, 2007-07

3
A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints

Park, MW; Kim, Yeong-Dae, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.123, no.3, pp.504 - 518, 2000-06

4
Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop

Choi, SW; Kim, Yeong-Dae; Lee, GC, INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.43, pp.2149 - 2167, 2005-06

rss_1.0 rss_2.0 atom_1.0