Some efficient heuristic methods for the flow shop sequencing problem-Reference-Cited by-同舟云学术

Some efficient heuristic methods for the flow shop sequencing problem

Published:1990-07 Issue:1 Volume:47 Page:65-74
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Taillard E.

Publisher

Elsevier BV

Subject

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

Reference9 articles.

1. Introduction to Sequencing and Scheduling;Baker,1974

2. Problèmes d'ordonnancement à contraintes de ressources: algorithmes et complexité;Carlier,1984

3. An evaluation of flow shop sequencing heuristics;Dannenbring;Management Science,1977

4. Tabu search — Part I;Glover;ORSA Journal on Computing,1989

5. INMOS Limited, IMS T414 Transputer, Engineering Data, INMOS Limited, 1000 Aztec West, Aldmondsbury, Bristol BS 124 SQ.

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

1. The paradoxes, accelerations and heuristics for a constrained distributed flowshop group scheduling problem;Computers & Industrial Engineering;2024-10

2. Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations;Computers & Operations Research;2024-10

3. A swarm intelligence optimization algorithm for human-robot collaborative energy-efficient shop scheduling;SCIENTIA SINICA Technologica;2024-09-01

4. Self-Adaptive Population-Based Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with Part of Jobs Subject to a Common Deadline Constraint;Expert Systems with Applications;2024-08

5. An iterated greedy algorithm with acceleration of job allocation probability for distributed heterogeneous permutation flowshop scheduling problem;Swarm and Evolutionary Computation;2024-07