Majid Khalili

ORCID: 0000-0003-0207-505X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Scheduling and Optimization Algorithms
  • Advanced Manufacturing and Logistics Optimization
  • Assembly Line Balancing Optimization
  • Optimization and Search Problems
  • Vehicle Routing Optimization Methods
  • Customer Service Quality and Loyalty
  • Data Management and Algorithms
  • Multi-Criteria Decision Making
  • Process Optimization and Integration
  • Metaheuristic Optimization Algorithms Research
  • Consumer Behavior in Brand Consumption and Identification
  • Digital Platforms and Economics
  • Supply Chain and Inventory Management
  • Digital Marketing and Social Media
  • Optimization and Packing Problems
  • Economic and Technological Innovation
  • Graph Labeling and Dimension Problems
  • Topic Modeling
  • Risk Management in Financial Firms
  • Education and Islamic Studies
  • Mobile Agent-Based Network Management
  • Heat Transfer Mechanisms
  • Electric Power System Optimization
  • Regional Economics and Spatial Analysis
  • Business Strategy and Innovation

International University of Chabahar
2019-2023

Islamic Azad University, Tehran
2012-2023

Islamic Azad University, Karaj
2009-2021

Islamic Azad University of Khomeynishahr
2021

Islamic Azad University Central Tehran Branch
2021

Islamic Azad University Saveh
2021

Islamic Azad University, Science and Research Branch
2009-2019

Islamic Azad University, Bonab Branch
2013

Islamic Azad University of Tabriz
2007-2011

Islamic Azad University South Tehran Branch
2008

10.1007/s00170-012-4375-x article EN The International Journal of Advanced Manufacturing Technology 2012-09-10

AbstractMajority of researches in no-wait flowshop scheduling assume that there is only one machine at each stage. But, factories commonly duplicate machines parallel for operation. In this case, they balance the speed stages, increase throughput shop floor and reduce impact bottleneck stages. Despite their importance, no paper to study general with machines. This studies problem where objective minimise makespan. Since mathematical model problem, we first mathematically formulate it form...

10.1080/00207543.2013.871389 article EN International Journal of Production Research 2014-01-08

10.1007/s00170-013-5376-0 article EN The International Journal of Advanced Manufacturing Technology 2013-10-26

10.1007/s00170-014-6305-6 article EN The International Journal of Advanced Manufacturing Technology 2014-09-01

The production planning and distribution are among the most important decisions in supply chain. Classically, this problem, it is assumed that all orders have to produced separately delivered; while, practice, an order may be rejected if cost brings chain exceeds its revenue. Moreover, can delivered a batch reduce related costs. This paper considers problem with acceptance package delivery maximize profit. At first, new mathematical model based on mixed integer linear programming developed....

10.1051/mfreview/2016018 article EN cc-by Manufacturing Review 2016-01-01

10.1007/s12190-020-01463-z article EN Journal of Applied Mathematics and Computing 2021-01-01

This paper studies multi-objective no-wait hybrid flowshop scheduling problems to minimise both makespan and total tardiness. Furthermore, we consider transportation times between machines. time can be either job-dependent or job-independent. We that all transportations are job-independent; two machines have done by one transporter. presents a new electromagnetism algorithm (MOEA). Electromagnetism is known as flexible effective population-based utilising an attraction/repulsion mechanism...

10.1504/ijcse.2012.048094 article EN International Journal of Computational Science and Engineering 2012-01-01

The job shop problem is the most complicated and typical of all kinds production scheduling problems, allocation resources over time to perform a collection tasks. This paper studies multi-objective problems where setup times sequence dependent minimise two objective functions simultaneously. Since NP-hard difficult find an optimal solution in reasonable computational efficient electromagnetism algorithm (MOEA) presented as procedure. An known flexible effective population-based utilising...

10.1504/ijiei.2014.067146 article EN International Journal of Intelligent Engineering Informatics 2014-01-01

Due to the variety of products, simultaneous production different models has an important role in systems. Moreover, considering realistic constraints designing lines attracted a lot attentions recent researches. Since assembly line balancing problem is NP-hard, efficient methods are needed solve this kind problems. In study, new hybrid method based on unconscious search algorithm (USGA) proposed mixed-model some conditions such as parallel workstation, zoning constraints, sequence dependent...

10.22094/joie.2020.579974.1605 article EN Journal of optimization in industrial engineering 2020-07-01

In recent years, the optimal design of workshop schedule has received much attention with increased competition in business environment. As a strategic issue, designing affects other decisions production chain. The purpose this thesis is to three-objective mathematical model, objectives minimizing work completion time, delay time and energy consumption, considering importance businesses reduce consumption years. developed model been solved using exact solution methods Weighted Sum (WS)...

10.31803/tg-20200815184439 article EN cc-by Tehnički glasnik 2021-03-04

Abstract This paper explores flexible flow lines where setup times are sequence dependent. The optimization criterion is the minimization of total weighted completion time. We propose an An iterated local search algorithm (ILS) proposed to tackle problem. Among different meta-heuristics, greedy (IGA) has shown high performance for simpler problems such as flowshops. looks at applying adapted IGA a much more complex problem well-known and evaluated. In this adaptation, completely decoding...

10.1080/17509653.2012.10671208 article EN International Journal of Management Science and Engineering Management 2012-01-01

The concept of matching in graph theory is very important. Now, this paper we considered the notion fuzzy graphs and generalized concept. First defined notions (maximum) edge-fuzzy number vertex-fuzzy number. Then compare them by crisp get related results. Finally give an application.

10.1109/cfis.2019.8692158 article EN 2019-01-01

There are two common simplifying assumptions made in the scheduling of operations. One is that machines available continuously, and other once a job completes one process it immediately for its next. Moreover, flowshops, commonly assumed jobs must visit all machines. In practice, however, these may not be justifiable some applications. This paper deals with generalized flow shop (GFS) problem machine availability constraints, transportation times between stages, skipping. The...

10.1051/mfreview/2014013 article EN cc-by Manufacturing Review 2014-01-01

The purpose of the present study is investigating relationship between performance industrial clusters and renovation small industries in East Azerbaijan, Iran. In this study, its dimensions including supporting institutions, communicative sectors production-business has been investigated using indices industries. participants include all 243 production units auto-parts manufacturing cluster province. Due to limited number subjects, census-taking was used. data collection instrument for...

10.19026/rjaset.5.5036 article EN cc-by Research Journal of Applied Sciences Engineering and Technology 2013-01-21
Coming Soon ...