Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
The no-idle permutation flowshop scheduling problem (NIPFSP) extends the well-known
permutation flowshop scheduling problem, where idle time is not allowed on the machines …
permutation flowshop scheduling problem, where idle time is not allowed on the machines …
Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem
Y Zhou, H Chen, G Zhou - Neurocomputing, 2014 - Elsevier
In this paper, an invasive weed optimization (IWO) scheduling algorithm is presented for
optimization no-idle flow-shop scheduling problem (NFSP) with the criterion to minimize the …
optimization no-idle flow-shop scheduling problem (NFSP) with the criterion to minimize the …
A novel general variable neighborhood search through q-learning for no-idle flowshop scheduling
In this study, a novel general variable neighborhood search through Q-learning (GVNS-QL)
algorithm is proposed to solve the no-idle flowshop scheduling problem with the makespan …
algorithm is proposed to solve the no-idle flowshop scheduling problem with the makespan …
No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm
A novel hybrid discrete particle swarm optimization (HDPSO) algorithm is proposed in this
paper to solve the no-idle permutation flow shop scheduling problems with the criterion to …
paper to solve the no-idle permutation flow shop scheduling problems with the criterion to …
A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems
A novel Discrete Differential Evolution (DDE) algorithm is proposed in this paper for solving
no-idle permutation flow-shop scheduling problems with maximum completion time …
no-idle permutation flow-shop scheduling problems with maximum completion time …
A heuristic for minimizing the makespan in no-idle permutation flow shops
PJ Kalczynski, J Kamburowski - Computers & Industrial Engineering, 2005 - Elsevier
The paper deals with the problem of finding a job sequence that minimizes the makespan in
m-machine flow shops under the no-idle condition. This condition requires that each …
m-machine flow shops under the no-idle condition. This condition requires that each …
Johnson's rule, composite jobs and the relocation problem
Two-machine flowshop scheduling to minimize makespan is one of the most well-known
classical scheduling problems. Johnson's rule for solving this problem has been widely cited …
classical scheduling problems. Johnson's rule for solving this problem has been widely cited …
[PDF][PDF] 基于离散蛙跳算法的零空闲流水线调度问题求解
王亚敏[1， 冀俊忠， 潘全科 - 北京工业大学学报, 2010 - journal.bjut.edu.cn
基于离散蛙跳算法的零空闲流水线调度问题求解 Page 1 第36 卷第1 期 2010 年1 月 北京工业
大学学报 JOURNAL OF BEIJING UNIVERSITY OF TECHNOLOGY Vol. 36 No. 1 Jan. 2010 …
大学学报 JOURNAL OF BEIJING UNIVERSITY OF TECHNOLOGY Vol. 36 No. 1 Jan. 2010 …
A general variable neighborhood search for the noIdle flowshop scheduling problem with makespan criterion
L Shen, MF Tasgetiren, H Öztop… - … Symposium Series on …, 2019 - ieeexplore.ieee.org
This paper proposes a novel general variable neighborhood search (GVNS) algorithm to
solve the no-idle flowshop scheduling problem with the makespan criterion. The initial …
solve the no-idle flowshop scheduling problem with the makespan criterion. The initial …
Problem F2∥ Cmax with forbidden jobs in the first or last position is easy
MY Kovalyov, F Werner - European journal of operational research, 2007 - Elsevier
Saadani et al.[NEH Saadani, P. Baptiste, M. Moalla, The simple F2∥ Cmax with forbidden
tasks in first or last position: A problem more complex that it seems, European Journal of …
tasks in first or last position: A problem more complex that it seems, European Journal of …