A note on permutation flow shop problem
From MaRDI portal
Publication:596465
DOI10.1023/B:ANOR.0000030691.65576.28zbMath1056.90123OpenAlexW2032823353MaRDI QIDQ596465
Publication date: 10 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000030691.65576.28
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (8)
Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ Maximizing Throughput in Flow Shop Real-Time Scheduling ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A linear time approximation algorithm for permutation flow shop scheduling ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
This page was built for publication: A note on permutation flow shop problem
