On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
From MaRDI portal
Publication:5168014
Recommendations
- A new heuristic for open shop total completion time problem
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
- New efficient heuristics for scheduling open shops with makespan minimization
- Flexible open shop scheduling problem to minimize makespan
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- A new heuristic for open shop total completion time problem
- Fifty years of scheduling: a survey of milestones
- Open Shop Scheduling to Minimize Finish Time
- Open shop scheduling problem to minimize makespan with release dates
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
- Scheduling the Open Shop to Minimize Mean Flow Time
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Unit Execution Time Shop Problems
Cited in
(5)- Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates
- An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times
- Hybrid multi-objective optimisation for concurrent activities consolidating two docked spacecraft
- A new heuristic for open shop total completion time problem
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
This page was built for publication: On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168014)