Narrow search
Showing 1 - 3 of 3
Cover Image
New approximate algorithms for the customer order scheduling problem with total completion time objective
Framian, Jose M.; Perez-Gonzalez, Paz - In: Computers & operations research : and their … 78 (2017), pp. 181-192
Persistent link: https://www.econbiz.de/10011631102
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
A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
Abreu, Levi Ribeiro de; Prata, Bruno A.; Nagano, … - In: Computers & operations research : and their … 160 (2023), pp. 1-12
Persistent link: https://www.econbiz.de/10014434466