A note on permutation flow shop problem

DOI10.1023/B:ANOR.0000030691.65576.28MaRDI QIDQ596465zbMATH OpenOpenAlexFDO

Authors Maxim Sviridenko

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tight bounds for permutation flow shop scheduling
• Tight Bounds for Permutation Flow Shop Scheduling
• Approximation algorithms for the parallel flow shop problem
• A linear time approximation algorithm for permutation flow shop scheduling
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times

Cited in

(20)

• An empirical analysis of the optimality rate of flow shop heuristics
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
• Exact exponential algorithms for 3-machine flowshop scheduling problems
• A computational study of the permutation flow shop problem based on a tight lower bound
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
• An improved NEH heuristic to minimize makespan in permutation flow shops
• scientific article; zbMATH DE number 4130180 (Why is no real title available?)
• Improved Bounds for Flow Shop Scheduling
• scientific article; zbMATH DE number 3916005 (Why is no real title available?)
• scientific article; zbMATH DE number 4089300 (Why is no real title available?)
• On the combinatorial structure of the permutation flow shop problem
• Permutation flow shop scheduling with order acceptance and weighted tardiness
• A note on scheduling jobs with missing operations in permutation flow shops
• Tight bounds for permutation flow shop scheduling
• Tight Bounds for Permutation Flow Shop Scheduling
• On some lower bounds for the permutation flowshop problem
• Maximizing Throughput in Flow Shop Real-Time Scheduling
• Mip-based local search for permutation flowshop scheduling with makespan objective
• Bounds for the permutation flowshop scheduling problem: new framework and theoretical insights
• A linear time approximation algorithm for permutation flow shop scheduling

This page was built for publication: A note on permutation flow shop problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596465)