Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Total flowtime")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 10 of 10

  • Page / 1
Export

Selection :

  • and

An efficient heuristic approach to the scheduling of jobs in a flowshopCHANDRASEKHARAN RAJENDRAN; DIPAK CHAUDHURI.European journal of operational research. 1992, Vol 61, Num 3, pp 318-325, issn 0377-2217Article

Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithmLIN, Shih-Wei; YING, Kuo-Ching.Computers & operations research. 2013, Vol 40, Num 6, pp 1625-1647, issn 0305-0548, 23 p.Article

A multi-stage parallel-processor flowshop problem with minimum flowtimeRAJENDRAN, C; CHAUDHURI, D.European journal of operational research. 1992, Vol 57, Num 1, pp 111-122, issn 0377-2217Article

Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimizationYI ZHANG; XIAOPING LI; QIAN WANG et al.European journal of operational research. 2009, Vol 196, Num 3, pp 869-876, issn 0377-2217, 8 p.Article

Two-machine flowshop scheduling with job class setups to minimize total flowtimeXIULI WANG; CHENG, T. C. E.Computers & operations research. 2005, Vol 32, Num 11, pp 2751-2770, issn 0305-0548, 20 p.Article

An iterated local search algorithm for the permutation flowshop problem with total flowtime criterionXINGYE DONG; HOUKUAN HUANG; PING CHEN et al.Computers & operations research. 2009, Vol 36, Num 5, pp 1664-1669, issn 0305-0548, 6 p.Article

A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobsVARADHARAJAN, T. K; RAJENDRAN, Chandrasekharan.European journal of operational research. 2005, Vol 167, Num 3, pp 772-795, issn 0377-2217, 24 p.Article

A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic schedulingTASGETIREN, M. Fatih; LIANG, Yun-Chia; SEVKLI, Mehmet et al.European journal of operational research. 2007, Vol 177, Num 3, pp 1930-1947, issn 0377-2217, 18 p.Article

A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem : Bio-inspired Methods in Combinatorial OptimizationPAN, Quan-Ke; TASGETIREN, M. Fatih; LIANG, Yun-Chia et al.Computers & operations research. 2008, Vol 35, Num 9, pp 2807-2839, issn 0305-0548, 33 p.Article

A hybrid genetic local search algorithm for the permutation flowshop scheduling problemTSENG, Lin-Yu; LIN, Ya-Tai.European journal of operational research. 2009, Vol 198, Num 1, pp 84-92, issn 0377-2217, 9 p.Article

  • Page / 1