Narrow search
Showing 1 - 10 of 644,174
Cover Image
A hybrid PSO-GA algorithm for job shop scheduling in machine tool production
Liu, Li-Lan; Hu, Rong-Song; Hu, Xiang-Ping; Zhao, Gai-Ping - In: International journal of production research 53 (2015) 19, pp. 5755-5781
Persistent link: https://www.econbiz.de/10011420802
Cover Image
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
Tanaka, Shunji; Araki, Mituhiko - In: Computers & operations research : and their … 40 (2013) 1, pp. 344-352
Persistent link: https://www.econbiz.de/10009658511
Cover Image
Makespan minimization on single batch-processing machine via ant colony optimization
Xu, Rui; Chen, Huaping; Li, Xueping - In: Computers & operations research : and their … 39 (2012) 3, pp. 582-593
Persistent link: https://www.econbiz.de/10009384612
Cover Image
Proposing a model for optimising planned lead-times and periodicity in MRP systems under uncertainty
Sadeghi, Haibatolah; Makui, Ahmad; Heydari, Mehdi; … - In: International journal of services and operations management 21 (2015) 3, pp. 310-331
Persistent link: https://www.econbiz.de/10011403692
Cover Image
A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
Xu, Kailiang; Feng, Zuren; Jun, Keliang - In: Computers & operations research : and their … 37 (2010) 11, pp. 1924-1938
Persistent link: https://www.econbiz.de/10003990146
Cover Image
An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
Panwalkar, S. S.; Koulamas, Christos - In: European journal of operational research : EJOR 221 (2012) 1, pp. 7-13
Persistent link: https://www.econbiz.de/10009553176
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 bottleneck-assignment based branch-and-bound algorithm to minimize the makespan in an m-machine permutation flowshop
Madhushini, N.; Rajendran, Chandrasekharan - In: Technology operation management : TOM ; official … 3 (2012) 1/2, pp. 1-10
Persistent link: https://www.econbiz.de/10010248552
Cover Image
New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm
Ding, Jian-Ya; Song, Shiji; Gupta, Jatinder N.; Wang, Cheng - In: International journal of production research 54 (2016) 15/16, pp. 4759-4772
Persistent link: https://www.econbiz.de/10011518969
Cover Image
Minimizing makespan in a no-wait flowshop with two batch processing machines using estimation of distribution algorithm
Zhou, Shengchao; Li, Xueping; Chen, Huaping; Guo, Cong - In: International journal of production research 54 (2016) 15/16, pp. 4919-4937
Persistent link: https://www.econbiz.de/10011519022