Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan

DOI10.1080/00207720903308397zbMath1233.90148OpenAlexW1998949778MaRDI QIDQ3102811

Danyu Bai, Lixin Tang

Publication date: 25 November 2011

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207720903308397

zbMATH Keywords

makespanworst case analysisopen shop problemasymptotical analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

New efficient heuristics for scheduling open shops with makespan minimization ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem ⋮ Evaluating environmental strategies in a textile printing and dyeing enterprise by an agent-based simulation model

Cites Work

• Unnamed Item
• Open shop scheduling with machine dependent processing times
• A greedy open shop heuristic with job priorities
• Constructive heuristic algorithms for the open shop problem
• A branch \(\&\) bound algorithm for the open-shop problem
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
• A new particle swarm optimization for the open shop scheduling problem
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
• Modeling the planning and scheduling across the outsourcing supply chain: a Chaos-based fast Tabu–SA approach
• Parallel machine scheduling problems with proportionally deteriorating jobs
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Short Shop Schedules
• Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
• Solving the open shop scheduling problem

This page was built for publication: Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan