A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop-Reference-Cited by-同舟云学术

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

Published:2008-12-15 Issue:24 Volume:46 Page:6913-6931
ISSN:0020-7543
Container-title:International Journal of Production Research
language:en
Short-container-title:International Journal of Production Research

Author:

Chiang T. C.,Fu L. C.

Publisher

Informa UK Limited

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research,Strategy and Management

Link

http://www.tandfonline.com/doi/pdf/10.1080/00207540701420578

Reference41 articles.

1. An SA/TS mixture algorithm for the scheduling tardiness problem

2. Two new rules to minimize tardiness in a job shop

3. Appleton-Day, K and Shao, L. 1997. Real-time dispatch gets real-time results in AMD's Fab25. Proceedings of the IEEE/SEMI Advanced Semiconductor Manufacturing Conference and Workshop. 1997. pp.444–447.

4. Tabu search for total tardiness minimization in flowshop scheduling problems

5. A Genetic Algorithm with Local Search for Solving Job Problems

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A HYBRID META-HEURISTIC ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN A DYNAMIC TWO-MACHINE FLOW SHOP PROBLEM;NUMER ALGEBR CONTROL;2017

2. Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion;Applied Soft Computing;2017-05

3. A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem;Numerical Algebra, Control & Optimization;2017

4. Job Shop Scheduling with Consideration of Due Dates;PROD LOGIST;2016

5. An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem;Computers & Operations Research;2014-05