Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems
From MaRDI portal
Publication:2147094
DOI10.1016/J.COR.2022.105810OpenAlexW4225752808MaRDI QIDQ2147094
Xiaoming Ruan, De Biao Li, Qing Yue
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105810
branch and bound algorithmimproved tabu search heuristicpharmacy automation dispensing systemsthree-stage assembly flowshop problem
Cites Work
- Unnamed Item
- Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times
- A branch and bound algorithm for the two-stage assembly scheduling problem
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- New approximate algorithms for the customer order scheduling problem with total completion time objective
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
- Flow-shop scheduling with setup and assembly operations
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- Scheduling flexible manufacturing cells using Tabu Search
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Scheduling independent tasks to reduce mean finishing time
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- The three-stage assembly flowshop scheduling problem
- Defining tabu list size and aspiration criterion within tabu search methods
This page was built for publication: Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems
