Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » Authors » Saeed Poormoaied

Journals

  • IJIEC (777)
  • MSL (2643)
  • DSL (690)
  • CCL (528)
  • USCM (1092)
  • ESM (421)
  • AC (562)
  • JPM (293)
  • IJDS (952)
  • JFS (101)
  • HE (32)
  • SCI (26)

Keywords

Supply chain management(168)
Jordan(165)
Vietnam(151)
Customer satisfaction(120)
Performance(115)
Supply chain(112)
Service quality(98)
Competitive advantage(97)
Tehran Stock Exchange(94)
SMEs(89)
optimization(87)
Sustainability(86)
Artificial intelligence(85)
Financial performance(84)
Trust(83)
TOPSIS(83)
Job satisfaction(81)
Genetic Algorithm(78)
Factor analysis(78)
Social media(78)


» Show all keywords

Authors

Naser Azad(82)
Zeplin Jiwa Husada Tarigan(66)
Mohammad Reza Iravani(64)
Endri Endri(45)
Muhammad Alshurideh(42)
Hotlan Siagian(40)
Dmaithan Almajali(37)
Jumadil Saputra(36)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Barween Al Kurdi(32)
Hassan Ghodrati(31)
Basrowi Basrowi(31)
Sautma Ronni Basana(31)
Mohammad Khodaei Valahzaghard(30)
Shankar Chakraborty(29)
Ni Nyoman Kerti Yasa(29)
Haitham M. Alzoubi(28)
Sulieman Ibraheem Shelash Al-Hawary(28)
Prasadja Ricardianto(28)


» Show all authors

Countries

Iran(2192)
Indonesia(1311)
Jordan(813)
India(793)
Vietnam(510)
Saudi Arabia(478)
Malaysia(444)
China(231)
United Arab Emirates(226)
Thailand(160)
United States(114)
Ukraine(110)
Turkey(110)
Egypt(106)
Peru(94)
Canada(93)
Morocco(86)
Pakistan(85)
United Kingdom(80)
Nigeria(78)


» Show all countries
Sort articles by: Volume | Date | Most Rates | Most Views | Reviews | Alphabet
1.

Optimizing combination of job shop scheduling and quadratic assignment problem through multi-objective decision making approach Pages 2011-2018 Right click to download the paper Download PDF

Authors: Mostafa Kazemi, Saeed Poormoaied, Ghasem Eslami

DOI: 10.5267/j.msl.2012.06.020

Keywords: Job shop scheduling, Multi-objective problem, Quadratic assignment problem

Abstract:
In this paper, we consider job shop scheduling and machine location problem, simultaneously. Processing, transportation, and setup times are defined as deterministic parameters. The purpose of this paper is to determine machine location and job scheduling such that the make span and transportation cost is minimized. Therefore, the proposed model is a multi-objective problem one, where the first objective function minimizes make span and another minimizes the transportation cost. To solve the multi-objective problem, two methods are evaluated. Considering combination of job shop scheduling problem and machine location problem makes the proposed model more complex than job shop scheduling problem, which is an NP-hard problem. Therefore, to solve the proposed model, genetic algorithm as a meta-heuristic algorithm is implemented. To show the efficiency of the proposed genetic algorithm, 6×6 job shop scheduling problems are considered.
Details
  • 0
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: MSL | Year: 2012 | Volume: 2 | Issue: 6 | Views: 2666 | Reviews: 0

 

® 2010-2026 GrowingScience.Com