A knowledge-based ant colony optimization for flexible job shop scheduling problems

LN Xing, YW Chen, P Wang, QS Zhao, J Xiong - Applied Soft Computing, 2010 - Elsevier
A Knowledge-Based Ant Colony Optimization (KBACO) algorithm is proposed in this paper
for the Flexible Job Shop Scheduling Problem (FJSSP). KBACO algorithm provides an …

An improved Lagrangian relaxation approach to scheduling steelmaking-continuous casting process

H Cui, X Luo - Computers & Chemical Engineering, 2017 - Elsevier
In the steelmaking continuous-casting (SCC) process, scheduling problem is a key issue for
the iron and steel production. To improve the productivity and reduce material consumption …

A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions

V Sels, N Gheysen, M Vanhoucke - International Journal of …, 2012 - Taylor & Francis
In this paper, a comparison and validation of various priority rules for the job shop
scheduling problem under different objective functions is made. In a first computational …

A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process

K Mao, Q Pan, X Pang, T Chai - European Journal of Operational Research, 2014 - Elsevier
One of the largest bottlenecks in iron and steel production is the steelmaking-continuous
casting (SCC) process, which consists of steel-making, refining and continuous casting. The …

Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling

LN Xing, YW Chen, KW Yang - Applied Soft Computing, 2009 - Elsevier
Flexible job shop schedule is very important in both fields of combinatorial optimization and
production management. In this paper, a simulation model is presented to solve the multi …

An effective PSO and AIS-based hybrid intelligent algorithm for job-shop scheduling

HW Ge, L Sun, YC Liang, F Qian - IEEE transactions on systems …, 2008 - ieeexplore.ieee.org
The optimization of job-shop scheduling is very important because of its theoretical and
practical significance. In this paper, a computationally effective algorithm of combining PSO …

Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches

M Rabiee, M Zandieh, P Ramezani - International Journal of …, 2012 - Taylor & Francis
This paper deals with a problem of partial flexible job shop with the objective of minimising
makespan and minimising total operation costs. This problem is a kind of flexible job shop …

An efficient search method for multi-objective flexible job shop scheduling problems

LN Xing, YW Chen, KW Yang - Journal of Intelligent manufacturing, 2009 - Springer
Flexible job shop scheduling is very important in both fields of production management and
combinatorial optimization. Owing to the high computational complexity, it is quite difficult to …

Application of firefly algorithm and its parameter setting for job shop scheduling

A Khadwilard, S Chansombat… - The Journal of …, 2012 - 202.44.34.85
Application of Firefly Algorithm and Its Parameter Setting for Job Shop Scheduling Page 1
บทความวิจัย วารสารวิชาการเทคโนโลยีอุตสาหกรรม ปที่8 ฉบับที่1 มกราคม – เมษายน 2555 The …

Scheduling a hybrid flowshop with batch production at the last stage

H Xuan, L Tang - Computers & Operations Research, 2007 - Elsevier
In this paper, we address the problem of scheduling n jobs in an s-stage hybrid flowshop
with batch production at the last stage with the objective of minimizing a given criterion with …