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

DOI10.1080/00207720903308397MaRDI QIDQ3102811zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

makespanworst case analysisopen shop problemasymptotical analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

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

Cited in

(6)

• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
• An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Flexible open shop scheduling problem to minimize 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)