Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times
出版年份 2022 全文链接
标题
Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times
作者
关键词
Distributed hybrid flow shop scheduling, Setup time, Mixed-integer linear programming, Constraint programming, Modeling idea
出版物
Swarm and Evolutionary Computation
Volume 71, Issue -, Pages 101058
出版商
Elsevier BV
发表日期
2022-03-25
DOI
10.1016/j.swevo.2022.101058
参考文献
相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。- A graph-based constraint programming approach for the integrated process planning and scheduling problem
- (2021) Luping Zhang et al. COMPUTERS & OPERATIONS RESEARCH
- Solving Type-2 Fuzzy Distributed Hybrid Flowshop Scheduling Using an Improved Brain Storm Optimization Algorithm
- (2021) Junqing Li et al. International Journal of Fuzzy Systems
- Energy-Aware Flexible Job Shop Scheduling Using Mixed Integer Programming and Constraint Programming
- (2021) Andy Ham et al. MATHEMATICAL PROBLEMS IN ENGINEERING
- An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems
- (2021) Yuan-Zhen Li et al. Swarm and Evolutionary Computation
- An optimal block knowledge driven backtracking search algorithm for distributed assembly No-wait flow shop scheduling problem
- (2021) Fuqing Zhao et al. APPLIED SOFT COMPUTING
- Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
- (2021) Weishi Shao et al. COMPUTERS & OPERATIONS RESEARCH
- A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers
- (2021) Chao Lu et al. ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
- Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem
- (2020) Weishi Shao et al. KNOWLEDGE-BASED SYSTEMS
- Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem
- (2020) Leilei Meng et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks
- (2020) Jingcao Cai et al. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
- A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times
- (2020) Yingli Li et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption
- (2020) Hande Öztop et al. Swarm and Evolutionary Computation
- A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop
- (2020) Jingcao Cai et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times
- (2020) Yingli Li et al. COMPUTERS & INDUSTRIAL ENGINEERING
- An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling
- (2019) Deming Lei et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- More MILP models for hybrid flow shop scheduling problem and its extended problems
- (2019) Leilei Meng et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- (2019) Victor Fernandez-Viagas et al. COMPUTERS & OPERATIONS RESEARCH
- A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling
- (2019) Jing-fang Chen et al. Swarm and Evolutionary Computation
- A constraint programming approach for solving unrelated parallel machine scheduling problem
- (2018) Ridvan Gedik et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks
- (2018) Kuo-Ching Ying et al. EXPERT SYSTEMS WITH APPLICATIONS
- Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines
- (2018) Leilei Meng et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion
- (2018) Hong-Yan Sang et al. Swarm and Evolutionary Computation
- MILP models for energy-aware flexible job shop scheduling problem
- (2018) Leilei Meng et al. JOURNAL OF CLEANER PRODUCTION
- A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem
- (2017) Jin Deng et al. Swarm and Evolutionary Computation
- Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches
- (2016) Andy M. Ham et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Hybrid flexible flowshop problems: Models and solution methods
- (2014) B. Naderi et al. APPLIED MATHEMATICAL MODELLING
- Modeling and heuristics for scheduling of distributed job shops
- (2014) B. Naderi et al. EXPERT SYSTEMS WITH APPLICATIONS
- Evaluation of mathematical models for flexible job-shop scheduling problems
- (2012) Yunus Demir et al. APPLIED MATHEMATICAL MODELLING
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- (2009) Cemal Özgüven et al. APPLIED MATHEMATICAL MODELLING
- An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem
- (2009) L. De Giovanni et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- (2006) Pedro Leite Rocha et al. COMPUTERS & OPERATIONS RESEARCH
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExplorePublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More