Similar Search Results

Narrow search

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

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

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

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

Trajectory scheduling methods for minimizing total tardiness in a flowshop

Li, Xiaoping; Chen, Long; Xu, Haiyan; Gupta, Jatinder N. - In: Operations research perspectives 2 (2015), pp. 13-23

In this paper, Trajectory Scheduling Methods (TSMs) are proposed for the permutation flowshop scheduling problem with total tardiness minimization criterion. TSMs belong to an iterative local search framework, in which local search is performed on an initial solution, a perturbation operator is...

Persistent link: https://www.econbiz.de/10011822464