Narrow search
Showing 1 - 10 of 1,721
Cover Image
Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
Fernandez-Viagas, Victor; Dios, Manuel; Framinan, Jose M. - In: Computers & operations research : and their … 75 (2016), pp. 38-48
Persistent link: https://www.econbiz.de/10011544955
Cover Image
A new set of high-performing heuristics to minimise flowtime in permutation flowshops
Fernandez-Viagas, Victor; Framinan, Jose M. - In: Computers & operations research : and their … 53 (2015), pp. 68-80
Persistent link: https://www.econbiz.de/10010493501
Cover Image
Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
Schaller, Jeffrey; Valente, Jorge - In: Computers & operations research : and their … 109 (2019), pp. 1-11
Persistent link: https://www.econbiz.de/10012065011
Cover Image
Fast heuristics for minimizing the makespan in non-permutation flow shops
Benavides, Alexander J.; Ritt, Marcus - In: Computers & operations research : and their … 100 (2018), pp. 230-243
Persistent link: https://www.econbiz.de/10011930607
Cover Image
Two-machine robotic cell scheduling problem with sequence-dependent setup times
Zarandi, M. H. Fazel; Mosadegh, H.; Fattahi, M. - In: Computers & operations research : and their … 40 (2013) 5, pp. 1420-1434
Persistent link: https://www.econbiz.de/10009735899
Cover Image
Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
Navaei, Javad; Fatemi Ghomi, S. M. T.; Jolai, Fariborz; … - In: Computers & operations research : and their … 44 (2014), pp. 52-65
Persistent link: https://www.econbiz.de/10010240598
Cover Image
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
Liu, Peihai; Lu, Xiwen - In: Computers & operations research : and their … 51 (2014), pp. 251-256
Persistent link: https://www.econbiz.de/10010408849
Cover Image
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
Fernandez-Viagas, Victor; Framinan, Jose M. - In: Computers & operations research : and their … 64 (2015), pp. 86-96
Persistent link: https://www.econbiz.de/10011373449
Cover Image
Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
Zhang, Guanghui; Xing, Keyi - In: Computers & operations research : and their … 108 (2019), pp. 33-43
Persistent link: https://www.econbiz.de/10012064921
Cover Image
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
Lin, Shih Wei; Ying, Kuo-ching - In: Computers & operations research : and their … 40 (2013) 6, pp. 1625-1647
Persistent link: https://www.econbiz.de/10009751542