Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
From MaRDI portal
Publication:3102811
DOI10.1080/00207720903308397zbMATH Open1233.90148OpenAlexW1998949778MaRDI QIDQ3102811FDOQ3102811
Authors: Danyu Bai, Lixin Tang 
Publication date: 25 November 2011
Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720903308397
Recommendations
- Flexible open shop scheduling problem to minimize makespan
- On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
- Open shop scheduling problem to minimize makespan with release dates
- Worst-case analysis of heuristics for open shops with parallel machines
- scientific article; zbMATH DE number 1279216
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Open Shop Scheduling to Minimize Finish Time
- Short Shop Schedules
- Open shop scheduling with machine dependent processing times
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- Constructive heuristic algorithms for the open shop problem
- Title not available (Why is that?)
- A new particle swarm optimization for the open shop scheduling problem
- A branch \(\&\) bound algorithm for the open-shop problem
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- Solving the open shop scheduling problem
- Parallel machine scheduling problems with proportionally deteriorating jobs
- Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
- A greedy open shop heuristic with job priorities
- Modeling the planning and scheduling across the outsourcing supply chain: a Chaos-based fast Tabu–SA approach
Cited In (4)
- On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- New efficient heuristics for scheduling open shops with makespan minimization
- Evaluating environmental strategies in a textile printing and dyeing enterprise by an agent-based simulation model
This page was built for publication: Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102811)
