Efficient heuristic approaches to transform job shops into flow shops-Reference-Cited by-同舟云学术

Efficient heuristic approaches to transform job shops into flow shops

Published:2005-03-23 Issue:5 Volume:37 Page:441-451
ISSN:0740-817X
Container-title:IIE Transactions
language:en
Short-container-title:IIE Transactions

Author:

FRAMINAN JOSE M.

Publisher

Informa UK Limited

Subject

Industrial and Manufacturing Engineering

Link

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

Reference21 articles.

1. A Computational Study of the Job-Shop Scheduling Problem

2. Improved heuristics and a genetic algorithm for finding short supersequences

3. Theory and algorithms for plan merging

4. Framinan, J. M. An adaptive branch and bound procedure for transforming job shops into flowshops. Technical report TROI/2002-02. Industrial Management, University of Seville.

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

1. A Study on Mathematical Models for Transforming the Job-Shop Layout Into Flow-Shop Layout;Advances in Digital Manufacturing Systems;2023

2. Text mining approach for bottleneck detection and analysis in printed circuit board manufacturing;Computers & Industrial Engineering;2021-04

3. A Deterministic Heuristic Algorithm to Minimize the Length of a Manufacturing Line in Transformation of Jobshops into Flowshops;Asset Analytics;2021

4. The Perioperative Surgical Home: High-reliability or Ultra-safe Organization?;International Anesthesiology Clinics;2019

5. An Ant-Colony Algorithm to Transform Jobshops into Flowshops: A Case of Shortest-Common-Supersequence Stringology Problem;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2012