A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage-Reference-Cited by-同舟云学术

A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage

Published:2004-01 Issue:1 Volume:152 Page:96-114
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Thornton Henry W,Hunsucker John L

Publisher

Elsevier BV

Subject

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

Reference33 articles.

1. An Introduction to Analysis of Variance;Bogartz,1994

2. Heuristics for scheduling in a flow shop with multiple processors;Brah;European Journal of Operational Research,1999

3. A heuristic algorithm for the n job, m machine sequencing problem;Campbell;Management Science,1970

4. Scheduling multiprocessor flow shops;Chen,1994

5. D.E. Deal, D.R. Parks, A heuristic algorithm for job shop scheduling, in: Proceedings of the 1999 Energy Sources Technology Conference and Exhibition, Houston, Texas, February 1–3, 1999

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

1. Adaptive Capacity Planning for Ambulatory Surgery Centers;Manufacturing & Service Operations Management;2022-11

2. Energy-time tradeoffs for remanufacturing system scheduling using an invasive weed optimization algorithm;Journal of Intelligent Manufacturing;2021-09-09

3. A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-Shop Scheduling Problem;IEEE Transactions on Cybernetics;2021

4. A review of scheduling problem and resolution methods in flexible flow shop;International Journal of Industrial Engineering Computations;2019

5. Adaptive Capacity Planning for Ambulatory Surgery Centers;SSRN Electronic Journal;2019