An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints

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

zbMATH Keywords

genetic algorithmassemblyFJSPcompilation rulestight job constraintstwo-dimensional integer code

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems

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