Minimizing the number of switch instances on a flexible machine in polynomial time-Reference-Cited by-同舟云学术

Minimizing the number of switch instances on a flexible machine in polynomial time

Published:2015-05 Issue:3 Volume:43 Page:317-322
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Adjiashvili David,Bosio Sandro,Zemmer Kevin

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference13 articles.

1. A study of replacement algorithms for a virtual-storage computer;Belady;IBM Syst. J.,1966

2. Minimizing the number of tool switches on a flexible machine;Crama;Int. J. Flexible Manuf. Syst.,1994

3. The tool switching problem revisited;Crama;European J. Oper. Res.,2007

4. A column generation approach to job grouping for flexible manufacturing systems;Crama;European J. Oper. Res.,1994

5. Y. Crama, J. van de Klundert, The approximability of tool management problems. Research Memorandum 019, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR), 1996.

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

1. Exploiting symmetry for the job sequencing and tool switching problem;European Journal of Operational Research;2024-08

2. Hybridizing local searching with genetic algorithms for the job sequencing and tool switching problem with non-identical parallel machines;Expert Systems with Applications;2023-08

3. Multiobjective Sequence-Dependent Job Sequencing and Tool Switching Problem;IEEE Systems Journal;2023-03

4. A two-stage heuristic for the sequence-dependent job sequencing and tool switching problem;Computers & Industrial Engineering;2022-01

5. A scheduling method for multi-robot assembly of aircraft structures with soft task precedence constraints;Robotics and Computer-Integrated Manufacturing;2021-10