129
Views
18
CrossRef citations to date
0
Altmetric
Original Articles

A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop

&
Pages 6913-6931 | Received 01 Apr 2007, Published online: 31 Oct 2008

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (4)

Jianyou Xu, Yunqiang Yin, T.C.E. Cheng, Chin-Chia Wu & Shusheng Gu. (2014) An improved memetic algorithm based on a dynamic neighbourhood for the permutation flowshop scheduling problem. International Journal of Production Research 52:4, pages 1188-1199.
Read now
Tiantang Liu, Zhibin Jiang & Na Geng. (2013) A memetic algorithm with iterated local search for the capacitated arc routing problem. International Journal of Production Research 51:10, pages 3075-3084.
Read now
Wei-Hsiu Huang, Pei‐Chann Chang, Meng‐Hiot Lim & Zhenzhen Zhang. (2012) Memes co‐evolution strategies for fast convergence in solving single machine scheduling problems. International Journal of Production Research 50:24, pages 7357-7377.
Read now
Veronique Sels, Nele Gheysen & Mario Vanhoucke. (2012) A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. International Journal of Production Research 50:15, pages 4255-4270.
Read now

Articles from other publishers (14)

Weishi Shao, Dechang Pi & Zhongshi Shao. (2017) Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion. Applied Soft Computing 54, pages 164-182.
Crossref
Edgar Macias, Fabricio Niebles, Genett Jimenez & Dionicio Neira. (2017) Applying genetic algorithm for hybrid job shop scheduling in a cosmetic industry. Applying genetic algorithm for hybrid job shop scheduling in a cosmetic industry.
Mostafa Abouei Ardakan, A. Kourank Beheshti, S. Hamid Mirmohammadi & Hamed Davari Ardakani. (2017) A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem. Numerical Algebra, Control & Optimization 7:4, pages 465-480.
Crossref
Ahmed W. El-Bouri. (2016) A score-based dispatching rule for job shop scheduling. A score-based dispatching rule for job shop scheduling.
Fuqing Zhao, Jianxin Tang, Junbiao Wang & Jonrinaldi. (2014) An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem. Computers & Operations Research 45, pages 38-50.
Crossref
Rui Zhang & Cheng Wu. (2012) A PMBGA to Optimize the Selection of Rules for Job Shop Scheduling Based on the Giffler-Thompson Algorithm. Journal of Applied Mathematics 2012, pages 1-17.
Crossref
Veronique Sels, Kjeld Craeymeersch & Mario Vanhoucke. (2011) A hybrid single and dual population search procedure for the job shop scheduling problem. European Journal of Operational Research 215:3, pages 512-523.
Crossref
Yu-ting Wang, Jun-qing Li, Kai-zhou Gao & Quan-ke Pan. (2011) Memetic Algorithm based on Improved Inver–over operator and Lin–Kernighan local search for the Euclidean traveling salesman problem. Computers & Mathematics with Applications 62:7, pages 2743-2754.
Crossref
Tsung-Che Chiang, Hsueh-Chien Cheng & Li-Chen Fu. (2011) NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Expert Systems with Applications 38:5, pages 5986-5999.
Crossref
James J. Cochran, Louis A. CoxJr.Jr., Pinar Keskinocak, Jeffrey P. Kharoufeh & J. Cole SmithPablo Moscato, Regina Berretta & Carlos Cotta. 2011. Wiley Encyclopedia of Operations Research and Management Science. Wiley Encyclopedia of Operations Research and Management Science.
Tsung-Che Chiang. (2010) Model simplification for accelerating simulation-based evaluation of dispatching rules in wafer fabrication facilities. Model simplification for accelerating simulation-based evaluation of dispatching rules in wafer fabrication facilities.
Tsung-Che Chiang, Hsueh-Chien Cheng & Li-Chen Fu. (2010) A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival. Computers & Operations Research 37:12, pages 2257-2269.
Crossref
Tsung-Che Chiang, Hsueh-Chien Cheng & Li-Chen Fu. 2009. Emerging Intelligent Computing Technology and Applications. Emerging Intelligent Computing Technology and Applications 813 825 .
Hsueh-Chien Cheng, Tsung-Che Chiang & Li-Chen Fu. (2008) A memetic algorithm for parallel batch machine scheduling with incompatible job families and dynamic job arrivals. A memetic algorithm for parallel batch machine scheduling with incompatible job families and dynamic job arrivals.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.