Narrow search
Showing 1 - 10 of 316
Cover Image
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Zhu, Jie; Li, Xiaoping; Wang, Qian - In: European journal of operational research : EJOR 198 (2009) 2, pp. 378-386
Persistent link: https://www.econbiz.de/10003852132
Cover Image
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Zhu, Jie; Li, Xiaoping; Wang, Qian - In: European journal of operational research : EJOR 198 (2009) 2, pp. 378-386
Persistent link: https://www.econbiz.de/10008237974
Cover Image
A divide and conquer-based greedy search for two-machine no-wait job shop problems with makespan minimisation
Zhu, Jie; Li, Xiaoping; Shen, Weiming - In: International journal of production research 50 (2012) 10, pp. 2692-2704
Persistent link: https://www.econbiz.de/10009575415
Cover Image
Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
Zhang, Yi; Li, Xiaoping; Wang, Qian - In: European journal of operational research : EJOR 196 (2009) 3, pp. 869-876
Persistent link: https://www.econbiz.de/10003824916
Cover Image
Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
Wang, Chuyang; Li, Xiaoping; Wang, Qian - In: European journal of operational research : EJOR 206 (2010) 1, pp. 64-72
Persistent link: https://www.econbiz.de/10003968286
Cover Image
Efficient composite heuristics for total flowtime minimization in permutation flow shops
Li, Xiaoping; Wang, Qian; Wu, Cheng - In: Omega : the international journal of management science 37 (2009) 1, pp. 155-164
Persistent link: https://www.econbiz.de/10003767328
Cover Image
A divide and conquer-based greedy search for two-machine no-wait job shop problems with makespan minimisation
Zhu, Jie; Li, Xiaoping; Shen, Weiming - In: International journal of production research : American … 50 (2012) 10, pp. 2692-2705
Persistent link: https://www.econbiz.de/10009978716
Cover Image
Efficient composite heuristics for total flowtime minimization in permutation flow shops
Li, Xiaoping; Wang, Qian; Wu, Cheng - In: Omega 37 (2009) 1, pp. 155-164
In this paper, permutation flow shops with total flowtime minimization are considered. General flowtime computing (GFC) is presented to accelerate flowtime computation. A newly generated schedule is divided into an unchanged subsequence and a changed part. GFC computes total flowtime of a...
Persistent link: https://www.econbiz.de/10005206116
Cover Image
Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
Wang, Chuyang; Li, Xiaoping; Wang, Qian - In: European journal of operational research : EJOR 206 (2010) 1, pp. 64-73
Persistent link: https://www.econbiz.de/10008400717
Cover Image
Heuristic for no-wait flow shops with makespan minimization
Li, Xiaoping; Wang, Qian; Wu, Cheng - In: International journal of production research : American … 46 (2008) 9, pp. 2519-2530
Persistent link: https://www.econbiz.de/10007994432