An efficient genetic algorithm for job shop scheduling with tardiness objectives-Reference-Cited by-同舟云学术

An efficient genetic algorithm for job shop scheduling with tardiness objectives

Published:2004-06 Issue:3 Volume:155 Page:616-630
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Mattfeld Dirk C,Bierwirth Christian

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference31 articles.

1. The shifting bottleneck procedure for job shop scheduling;Adams;Management Science,1988

2. Machine scheduling;Anderson,1997

3. Introduction to Sequencing and Scheduling;Baker,1974

4. Production scheduling and rescheduling with genetic algorithms;Bierwirth;Evolutionary Computation,1999

5. On permutation representations for scheduling problems;Bierwirth,1996

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

1. A deep reinforcement learning model for dynamic job-shop scheduling problem with uncertain processing time;Engineering Applications of Artificial Intelligence;2024-05

2. Improved genetic algorithm for solving the total weight tardiness job shop scheduling problem;Journal of Intelligent & Fuzzy Systems;2024-03-15

3. Electric vehicle community charging hubs in multi-unit dwellings: Scheduling and techno-economic assessment;Transportation Research Part D: Transport and Environment;2023-07

4. Genetic Programming with Multi-case Fitness for Dynamic Flexible Job Shop Scheduling;2022 IEEE Congress on Evolutionary Computation (CEC);2022-07-18

5. A New MINLP Continuous Time Formulation for Scheduling Optimization of Oil Refinery with Unreliable CDUs;Mathematical Problems in Engineering;2022-03-10