An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
Authors
Keywords
-
Journal
International Transactions in Operational Research
Volume -, Issue -, Pages -
Publisher
Wiley
Online
2020-01-02
DOI
10.1111/itor.12767
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules
- (2018) Sicheng Zhang et al. IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT
- A new double flexible job-shop scheduling problem integrating processing time, green production, and human factor indicators
- (2018) Guiliang Gong et al. JOURNAL OF CLEANER PRODUCTION
- The two stage assembly flow-shop scheduling problem with batching and delivery
- (2017) Hamed Kazemi et al. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
- A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility
- (2017) Xuran Gong et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- A two-stage three-machine assembly scheduling problem with a position-based learning effect
- (2017) Chin-Chia Wu et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- A flexible job shop cell scheduling with sequence-dependent family setup times and intercellular transportation times using conic scalarization method
- (2017) Derya Deliktas et al. International Transactions in Operational Research
- A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling
- (2017) Qianwang Deng et al. Computational Intelligence and Neuroscience
- An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time
- (2016) Kai Zhou Gao et al. EXPERT SYSTEMS WITH APPLICATIONS
- Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling
- (2015) N. Shivasankaran et al. International Journal of Computational Intelligence Systems
- An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
- (2015) Kai Zhou Gao et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem
- (2015) Maroua Nouiri et al. JOURNAL OF INTELLIGENT MANUFACTURING
- Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem
- (2015) Marco Antonio Cruz-Chávez et al. International Transactions in Operational Research
- A research survey: review of flexible job shop scheduling techniques
- (2015) Imran Ali Chaudhry et al. International Transactions in Operational Research
- Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling
- (2015) N. Shivasankaran et al. International Journal of Computational Intelligence Systems
- Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships
- (2014) Andrea Rossi INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations
- (2014) Yunus Demir et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives
- (2014) K. Z. Gao et al. JOURNAL OF INTELLIGENT MANUFACTURING
- Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity
- (2012) Jun-qing Li et al. APPLIED SOFT COMPUTING
- A comparison of hybrid genetic algorithm and hybrid particle swarm optimization to minimize makespan for assembly job shop
- (2012) T.C. Wong et al. APPLIED SOFT COMPUTING
- A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem
- (2010) Mariano Frutos et al. ANNALS OF OPERATIONS RESEARCH
- A hybrid variable neighborhood search algorithm for solving multi-objective flexible job shop problems
- (2010) Jun-Qing Li et al. Computer Science and Information Systems
- An effective genetic algorithm for the flexible job-shop scheduling problem
- (2010) Guohui Zhang et al. EXPERT SYSTEMS WITH APPLICATIONS
- A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system
- (2010) Yun Wen et al. INFORMATION SCIENCES
- Integrating order review/release and dispatching rules for assembly job shop scheduling using a simulation approach
- (2010) H.L. Lu et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- A CAE-integrated distributed collaborative design system for finite element analysis of complex product based on SOOA
- (2009) Jiaqing Yu et al. ADVANCES IN ENGINEERING SOFTWARE
- A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems
- (2009) Li-Ning Xing et al. APPLIED SOFT COMPUTING
- A resource-constrained assembly job shop scheduling problem with Lot Streaming technique
- (2009) T.C. Wong et al. COMPUTERS & INDUSTRIAL ENGINEERING
- A new algorithm for complex product flexible scheduling with constraint between jobs
- (2009) Zhiqiang Xie et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling
- (2008) Li-Ning Xing et al. APPLIED SOFT COMPUTING
- An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem
- (2008) Guohui Zhang et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Lot streaming for product assembly in job shop environment
- (2007) F.T.S. Chan et al. ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
Add your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload NowAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started