A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

1983/01/01 by Muhammad Nawaz, E Emory Enscore, Inyong Ham · 5 citations

paper · doi:10.1016/0305-0483(83)90088-9

Cited by

• Refined Iterated Pareto Greedy for Energy-aware Hybrid Flowshop Scheduling with Blocking Constraints
• Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
• AutoEP: LLMs-Driven Automation of Hyperparameter Evolution for Metaheuristic Algorithms
• HiFo-Prompt: Prompting with Hindsight and Foresight for LLM-based Automatic Heuristic Design
• ACCORD: Autoregressive Constraint-satisfying Generation for COmbinatorial Optimization with Routing and Dynamic attention