Scheduling algorithms for flexible flowshops: Worst and average case performance-Reference-Cited by-同舟云学术

Scheduling algorithms for flexible flowshops: Worst and average case performance

Published:1989-11 Issue:2 Volume:43 Page:143-160
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Sriskandarajah C.,Sethi S.P.

Publisher

Elsevier BV

Subject

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

Reference25 articles.

1. On some problems of sequencing and grouping;Arthanari,1974

2. An application of bin-packing to multi-processor scheduling;Coffman;SIAM Journal of Computing,1978

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

4. Tighter bounds for multifit processor scheduling algorithm;Friesen;SIAM Journal of Computing,1984

5. Evaluation of a multifit-based scheduling algorithm;Friesen;Journal of Algorithms,1986

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

1. Single-lot, lot-streaming problem for a 1 + m hybrid flow shop;Journal of Global Optimization;2024-01-12

2. An Evaluation of Mathematical Programming and Lower-Bound Methods for Hybrid Flow Shop Problems With a Makespan Criterion;IEEE Access;2023

3. MTD-DHJS: Makespan-Optimized Task Scheduling Algorithm for Cloud Computing With Dynamic Computational Time Prediction;IEEE Access;2023

4. Enhancement of two-stage flow shop multiprocessor scheduling problems using a target-oriented genetic algorithm;Journal of Intelligent & Fuzzy Systems;2022-09-22

5. Bat Algorithm With Generalized Fly for Combinatorial Production Optimization Problems;Technological Innovations in Knowledge Management and Decision Support;2019