Multiobjective Optimization for Complex Flexible Job-Shop Scheduling Problems
Published 2021 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Multiobjective Optimization for Complex Flexible Job-Shop Scheduling Problems
Authors
Keywords
Scheduling, Multiobjective optimization, Flexible job-shop scheduling with batching, Metaheuristics, OR in semiconductor manufacturing
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume -, Issue -, Pages -
Publisher
Elsevier BV
Online
2021-04-29
DOI
10.1016/j.ejor.2021.03.069
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
- (2019) Andrés Alberto García-León et al. COMPUTERS & OPERATIONS RESEARCH
- Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems
- (2018) Muhammad Kamal Amjad et al. MATHEMATICAL PROBLEMS IN ENGINEERING
- Metaheuristics for the job-shop scheduling problem with machine availability constraints
- (2018) Karim Tamssaouet et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Setting daily production targets with novel approximation of target tracking operations for semiconductor manufacturing
- (2018) Yu-Ting Kao et al. JOURNAL OF MANUFACTURING SYSTEMS
- A batch-oblivious approach for Complex Job-Shop scheduling problems
- (2017) Sebastian Knopp et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An iterated greedy metaheuristic for the blocking job shop scheduling problem
- (2015) Marco Pranzo et al. JOURNAL OF HEURISTICS
- A research survey: review of flexible job shop scheduling techniques
- (2015) Imran Ali Chaudhry et al. International Transactions in Operational Research
- A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
- (2014) Abdoul Bitar et al. JOURNAL OF SCHEDULING
- Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study
- (2013) Michele Ciavotta et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
- (2011) Shih-Wei Lin et al. COMPUTERS & OPERATIONS RESEARCH
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- (2011) Yazid Mati et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing
- (2011) Claude Yugma et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations
- (2011) Lars Mönch et al. JOURNAL OF SCHEDULING
- Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability
- (2010) Yazid Mati COMPUTERS & INDUSTRIAL ENGINEERING
- A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
- (2008) S. Bandyopadhyay et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- (2006) Rubén Ruiz et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreDiscover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversation