Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » Decision Science Letters » Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown

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)

DSL Volumes

    • Volume 1 (10)
      • Issue 1 (5)
      • Issue 2 (5)
    • Volume 2 (30)
      • Issue 1 (5)
      • Issue 2 (6)
      • Issue 3 (9)
      • Issue 4 (10)
    • Volume 3 (53)
      • Issue 1 (15)
      • Issue 2 (10)
      • Issue 3 (19)
      • Issue 4 (9)
    • Volume 4 (48)
      • Issue 1 (10)
      • Issue 2 (12)
      • Issue 3 (14)
      • Issue 4 (12)
    • Volume 5 (39)
      • Issue 1 (12)
      • Issue 2 (10)
      • Issue 3 (8)
      • Issue 4 (9)
    • Volume 6 (30)
      • Issue 1 (8)
      • Issue 2 (6)
      • Issue 3 (9)
      • Issue 4 (7)
    • Volume 7 (41)
      • Issue 1 (8)
      • Issue 2 (8)
      • Issue 3 (8)
      • Issue 4 (17)
    • Volume 8 (38)
      • Issue 1 (8)
      • Issue 2 (6)
      • Issue 3 (14)
      • Issue 4 (10)
    • Volume 9 (39)
      • Issue 1 (8)
      • Issue 2 (9)
      • Issue 3 (14)
      • Issue 4 (8)
    • Volume 10 (43)
      • Issue 1 (7)
      • Issue 2 (8)
      • Issue 3 (20)
      • Issue 4 (8)
    • Volume 11 (49)
      • Issue 1 (9)
      • Issue 2 (9)
      • Issue 3 (14)
      • Issue 4 (17)
    • Volume 12 (64)
      • Issue 1 (12)
      • Issue 2 (24)
      • Issue 3 (13)
      • Issue 4 (15)
    • Volume 13 (78)
      • Issue 1 (21)
      • Issue 2 (18)
      • Issue 3 (19)
      • Issue 4 (20)
    • Volume 14 (87)
      • Issue 1 (21)
      • Issue 2 (23)
      • Issue 3 (25)
      • Issue 4 (18)
    • Volume 15 (41)
      • Issue 1 (19)
      • Issue 2 (22)

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

Decision Science Letters

ISSN 1929-5812 (Online) - ISSN 1929-5804 (Print)
Quarterly Publication
Volume 5 Issue 1 pp. 157-168 , 2016

Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown Pages 157-168 Right click to download the paper Download PDF

Authors: A. Adressi, S. Tasouji Hassanpour, V. Azizi

DOI: 10.5267/j.dsl.2015.7.001

Keywords: Group Scheduling, Machine Breakdown, No-wait Flowshop, Sequence-dependent Setup Times

Abstract: In this paper, group scheduling problem in no-wait flexible flowshop is considered by considering two stages with group sequence-dependent setup times and random breakdown of the machines. Genetic algorithm and simulated annealing based heuristics have been proposed to solve the problem. The primary objective of scheduling is to minimize the maximum completion time of the jobs for two classes of small and large scale problems. Computational results show that both GA and SA algorithms perform properly, but SA appeared to provide better results for both small and large scale problems.

How to cite this paper
Adressi, A., Hassanpour, S & Azizi, V. (2016). Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown.Decision Science Letters , 5(1), 157-168.

Refrences
Aldowaisan, T., Allahverdi, Ali. (2003). New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research, 30, 1219–1231.

Ahmadizar, F., Ghazanfari, M., & Fatemi Ghomi, S.M.T. (2009). Application of chance-constrained programming for stochastic group shop scheduling problem. International Journal of Advanced Manufacturing Technology, 42, 321–334.

Attar, S.F., Mohammadi, M., & Tavakkoli-Moghaddam, R. (2011). A novel imperialist competitive algorithm for solving flexible flow shop scheduling problem to minimizing maximum completion time. International Journal of Computer Applications, 28(10), 27-32.

Ashhari, A. (2012). Group scheduling in flexible flowshop, master degree thesis, K. N Toosi University of Technology. (In Farsi).

Gholami, M., Zandieh, M., & Alem-Tabriz, A. (2009). Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Advanced Manufacturing Technology, 42, 189–201.

Gupta, J. N., & Stafford, E. F. (2006). Flowshop scheduling research after five decades. European Journal of Operational Research, 169(3), 699-711.‏

Gupta, J.N.D. Strusevich, V.A., & Zwaneveld, C.M. (1997). Two-stage no-wait scheduling models with setup and removal times separated. Computer Operation Research, 24, 1025–1031.

Jinxing, X., Xijun, W. (2005). Complexity and Algorithms for Two-Stage Flexible Flow shop Scheduling with Availability Constraints. Computer and Mathematics with Application, 50, 1629-1638.

Salmasi, N. (2005). Multi-stage group scheduling problems with sequence dependent setups. Ph.D. thesis. Department of Industrial and Mifacturing Engineering, Oregon State University.

Hall, N.G., Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait inprocess, Operations Research, 44, 510-525.

Jolai, F., Rabiee, M., & Asefi, H. (2012). A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times. International Journal of Production Research, 50(24), 7447-7466.

Junlin, C. Weiwu, Y., & Huihe, S. (2004). Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal times. American Control Conference Boston. Massachusetts.

Lin, H. T., Liao, C. J. (2003). A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics, 86, 133–143.

Liu, Z., Xie, J., Li, J., & Dong, J. (2003). A heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage. Tsinghua Science and Technology, 8(1), 43-48.

Logendran, R, Salmasi, N., & Sriskandarajah, C. (2006). Two-machine group scheduling problems in discrete parts manufacturing with sequence dependent setups. Journal of Computers and Operations Research, 33, 158-180.

Mirabi, M., Fatemi Ghomi, S.M.T., & Jolai, F. (2013). A two-stage hybrid flowshop scheduling problem in machine breakdown condition. Journal of Intelligence Manufacturing, 24, 193–199.

Moradinasab, N., Shafaei, R., Rabiee, M., & Mazinani, M. (2012). Minimization of maximum tardiness in a no-wait two stage flexible flow shop. International Journal of Artificial Intelligence, 8, 516-529.

Wang, Z., Xing, W., & Bai, F. (2005). No-wait flexible flowshop scheduling with no-idle machines. Operations Research Letters, 33, 609 – 614.

Ruiz, R., Maroto, C., & Alcaraz, J. (2005). Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165, 34–54.

Schaller, J. (2001). A new lower bound for the flow shop group scheduling problem. Computers and Industrial Engineering, 41, 151-161.

Samarghandi, H., ElMekkawy T.Y. (2012). A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion. International Journal of Advanced Manufacturing Technology, 61, 1101–1114.

Salmasi, D., Logendran, R., & Skandaria, M.R. (2011). Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Scientia Iranica ,18, 759-764.

Shafaei, R., Rabiee, M., & Mirzaeyan, M. (2011). An adaptive neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop. International Journal of Computer Integrated Manufacturing, 24, 888-899.
  • 51
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: Decision Science Letters | Year: 2016 | Volume: 5 | Issue: 1 | Views: 2996 | Reviews: 0

Related Articles:
  • A new effective heuristic method for the no-wait flowshop with sequence-dep ...
  • Scheduling stochastic two-machine flow shop problems to minimize expected m ...
  • An imperialist competitive algorithm for a bi-objective parallel machine sc ...
  • A two-phase fuzzy programming model for a complex bi-objective no-wait flow ...
  • A comprehensive mathematical model for hybrid flexible flowshop lot streami ...

Add Reviews

Name:*
E-Mail:
Review:
Bold Italic Underline Strike | Align left Center Align right | Insert smilies Insert link URLInsert protected URL Select color | Add Hidden Text Insert Quote Convert selected text from selection to Cyrillic (Russian) alphabet Insert spoiler
winkwinkedsmileam
belayfeelfellowlaughing
lollovenorecourse
requestsadtonguewassat
cryingwhatbullyangry
Security Code: *
Include security image CAPCHA.
Refresh Code

® 2010-2026 GrowingScience.Com