New results in the worst-case analysis for flow-shop scheduling
From MaRDI portal
(Redirected from Publication:689950)
Cites work
- scientific article; zbMATH DE number 432815 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- An Evaluation of Flow Shop Sequencing Heuristics
- Flowshop and Jobshop Schedules: Complexity and Approximation
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Optimal two- and three-stage production schedules with set-up time included
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
Cited in
(11)- Performance guarantees for flowshop heuristics to minimize makespan
- Experimental comparison of heuristics for flow shop scheduling
- A linear time approximation algorithm for permutation flow shop scheduling
- A two-machine permutation flow shop scheduling problem with buffers
- Some results of the worst-case analysis for flow shop scheduling
- An improved NEH heuristic to minimize makespan in permutation flow shops
- An empirical analysis of the optimality rate of flow shop heuristics
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- A fast tabu search algorithm for the permutation flow-shop problem
- A new constructive heuristic for the flowshop scheduling problem
- A note on worst-case analysis of approximation algorithms for a scheduling problem
This page was built for publication: New results in the worst-case analysis for flow-shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689950)
