An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
From MaRDI portal
Publication:6092532
DOI10.1111/itor.12767OpenAlexW2996941601WikidataQ126418642 ScholiaQ126418642MaRDI QIDQ6092532
Kexin Li, Unnamed Author, Wen-Hui Lin, Qianwang Deng, Unnamed Author
Publication date: 23 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12767
Related Items (1)
Cites Work
- Unnamed Item
- New trends in machine scheduling
- Multi-resource shop scheduling with resource flexibility
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
- Routing and scheduling in a flexible job shop by tabu search
- A CAE-integrated distributed collaborative design system for finite element analysis of complex product based on SOOA
- A research survey: review of flexible job shop scheduling techniques
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem
- Advances in Neural Networks – ISNN 2005
- A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method
This page was built for publication: An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints