New results in the worst-case analysis for flow-shop scheduling
From MaRDI portal
Publication:689950
DOI10.1016/0166-218X(93)90156-IzbMATH Open0848.68009MaRDI QIDQ689950FDOQ689950
Authors: Eugeniusz Nowicki, Czesław Smutnicki 
Publication date: 8 October 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- An Evaluation of Flow Shop Sequencing Heuristics
- Flowshop and Jobshop Schedules: Complexity and Approximation
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- Title not available (Why is that?)
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
Cited In (11)
- Performance guarantees for flowshop heuristics to minimize makespan
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A linear time approximation algorithm for permutation flow shop scheduling
- Experimental comparison of heuristics for flow shop scheduling
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- An empirical analysis of the optimality rate of flow shop heuristics
- 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
- A new constructive heuristic for the flowshop 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)
