Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan

In this paper a discrete particle swarm optimization (DPSO) algorithm is proposed to solve permutation flowshop scheduling problems with the objective of minimizing the makespan. A discussion on implementation details of DPSO algorithm is presented. The proposed algorithm has been applied to a set o...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Natural Computation pp. 572 - 581
Main Authors Rameshkumar, K., Suresh, R. K., Mohanasundaram, K. M.
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Constructive Heuristic
Exact sciences and technology
Flowshop Schedule Problem
Large Size Problem
Local Search
Optimal Power Flow
Local search
Permutation
Heuristic method
Discrete programming
Flow shop
Swarm intelligence
Scheduling
Makespan
Online AccessGet full text

Cover

Abstract In this paper a discrete particle swarm optimization (DPSO) algorithm is proposed to solve permutation flowshop scheduling problems with the objective of minimizing the makespan. A discussion on implementation details of DPSO algorithm is presented. The proposed algorithm has been applied to a set of benchmark problems and performance of the algorithm is evaluated by comparing the obtained results with the results published in the literature. Further, it is found that the proposed improvement heuristic algorithm performs better when local search is performed. The results are presented.
AbstractList In this paper a discrete particle swarm optimization (DPSO) algorithm is proposed to solve permutation flowshop scheduling problems with the objective of minimizing the makespan. A discussion on implementation details of DPSO algorithm is presented. The proposed algorithm has been applied to a set of benchmark problems and performance of the algorithm is evaluated by comparing the obtained results with the results published in the literature. Further, it is found that the proposed improvement heuristic algorithm performs better when local search is performed. The results are presented.
Author Rameshkumar, K.
Mohanasundaram, K. M.
Suresh, R. K.
Author_xml – sequence: 1
  givenname: K.
  surname: Rameshkumar
  fullname: Rameshkumar, K.
  email: k_rameshkumar@ettimadai.amrita.edu
  organization: Department of Production Engineering, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Ettimadai, Coimbatore, India
– sequence: 2
  givenname: R. K.
  surname: Suresh
  fullname: Suresh, R. K.
  organization: Department of Production Engineering, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Ettimadai, Coimbatore, India
– sequence: 3
  givenname: K. M.
  surname: Mohanasundaram
  fullname: Mohanasundaram, K. M.
  organization: Department of Mechanical Engineering, PSG College of Technology, Coimbatore, India
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17135891$$DView record in Pascal Francis
BookMark eNpNkE1PGzEYhE2hUgPkxB_wpRIcFt7Xr_fDR8RHiwRKpMB5Zbx24rJrr-xFCH59E6WHzmUO82hGmmN2FGKwjJ0hXCJAfYVYklIg2hoO2DGVEgibivAbm2GFWBBJdcjmqm52mWhIAB6xGRCIQtWSfrB5zn9gK8IKRDVj4dZnk-xk-VKnyZve8tWHTgNfjJMf_JeefAz8_Ha5Wlzw634dk582A3cx8aVNw_u0B-77-JE3ceQrs7Hde-_Dmk-RP_mwK7H8Sb_ZPOpwyr473Wc7_-cn7OX-7vnmd_G4-PVwc_1YjALVVGgqm6oTJUqQTjqjDCpJtarJQfdqbCc0OlmBrYRtnJAAJXWmE2BkhU4RnbCf-95RZ6N7l3QwPrdj8oNOny3WuF1QuOUu9lzeRmFtU_sa41tuEdrd4e1_h9Nf8WVvQw
ContentType Book Chapter
Conference Proceeding
Copyright Springer-Verlag Berlin Heidelberg 2005
2005 INIST-CNRS
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2005
– notice: 2005 INIST-CNRS
DBID IQODW
DOI 10.1007/11539902_70
DatabaseName Pascal-Francis
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISBN 3540318631
9783540318637
EISSN 1611-3349
Editor Wang, Lipo
Ong, Yew Soon
Chen, Ke
Editor_xml – sequence: 1
  givenname: Lipo
  surname: Wang
  fullname: Wang, Lipo
  email: elpwang@ntu.edu.sg
– sequence: 2
  givenname: Ke
  surname: Chen
  fullname: Chen, Ke
  email: chenk@cs.zju.edu.cn
– sequence: 3
  givenname: Yew Soon
  surname: Ong
  fullname: Ong, Yew Soon
  email: asysong@ntu.edu.sg
EndPage 581
ExternalDocumentID 17135891
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RIG
RNI
RSU
SVGTG
VI1
~02
IQODW
ID FETCH-LOGICAL-p219t-a3586d251404f4fc9c19437973f0dbced2a1f460e62e8f240053dcd20c461f933
ISBN 9783540283201
354028320X
3540283234
9783540283232
ISSN 0302-9743
IngestDate Mon Jul 21 09:10:25 EDT 2025
Tue Jul 29 20:02:09 EDT 2025
IsPeerReviewed true
IsScholarly true
Keywords Local search
Permutation
Heuristic method
Discrete programming
Flow shop
Swarm intelligence
Scheduling
Makespan
Language English
License CC BY 4.0
LinkModel OpenURL
MeetingName Advances in natural computation (Changsha, 27-29 August 2005)
MergedId FETCHMERGED-LOGICAL-p219t-a3586d251404f4fc9c19437973f0dbced2a1f460e62e8f240053dcd20c461f933
PageCount 10
ParticipantIDs pascalfrancis_primary_17135891
springer_books_10_1007_11539902_70
PublicationCentury 2000
PublicationDate 2005
PublicationDateYYYYMMDD 2005-01-01
PublicationDate_xml – year: 2005
  text: 2005
PublicationDecade 2000
PublicationPlace Berlin, Heidelberg
PublicationPlace_xml – name: Berlin, Heidelberg
– name: Berlin
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSubtitle First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part III
PublicationTitle Advances in Natural Computation
PublicationYear 2005
Publisher Springer Berlin Heidelberg
Springer
Publisher_xml – name: Springer Berlin Heidelberg
– name: Springer
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Tygar, Dough
Steffen, Bernhard
Kittler, Josef
Vardi, Moshe Y.
Weikum, Gerhard
Sudan, Madhu
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, UK
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, UK
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, CA, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
  organization: University of Bern, Switzerland
– sequence: 9
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology, Madras, India
– sequence: 10
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: University of Dortmund, Germany
– sequence: 11
  givenname: Madhu
  surname: Sudan
  fullname: Sudan, Madhu
  organization: Massachusetts Institute of Technology, MA, USA
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: New York University, NY, USA
– sequence: 13
  givenname: Dough
  surname: Tygar
  fullname: Tygar, Dough
  organization: University of California, Berkeley, USA
– sequence: 14
  givenname: Moshe Y.
  surname: Vardi
  fullname: Vardi, Moshe Y.
  organization: Rice University, Houston, USA
– sequence: 15
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max-Planck Institute of Computer Science, Saarbruecken, Germany
SSID ssj0000316026
ssj0002792
ssj0000316024
Score 2.07423
Snippet In this paper a discrete particle swarm optimization (DPSO) algorithm is proposed to solve permutation flowshop scheduling problems with the objective of...
SourceID pascalfrancis
springer
SourceType Index Database
Publisher
StartPage 572
SubjectTerms Applied sciences
Artificial intelligence
Computer science; control theory; systems
Constructive Heuristic
Exact sciences and technology
Flowshop Schedule Problem
Large Size Problem
Local Search
Optimal Power Flow
Title Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan
URI http://link.springer.com/10.1007/11539902_70
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9tAEF6FcKl66FulLWhV9dDKsmV7_Tz0gAoIAQmIR8XNWnvXJILYUWKE1N_SH8uMdzdxoEJtL1a0Spz1zOfZeQ8hX3LXS3IwuWzBfDBQ4iiy87SI7CANWC59JhOOroHBMNq_CA4uw8te73cna-m2yZ3i1x_rSv6Hq7AGfMUq2X_g7OKmsACfgb9wBQ7D9YHyu-pmVenFKnrf5rMOuWqfoWY0rATXTzENdnRtMqkPnWUYCCzt1qly6nSWB_WIV7yt25spsBw61sDpQmtnDLIGlG1QPxXurLM7PptYxyB-JrquEzXXnZOzY_Q6bN9c1bNxM5q0OY0ncBboPVp7N_XdfFRPsRkonHltaTwow4NxhTfCsUjXEkSeehgkqZx_P9JRj2HdqIc3gymMnFpxZIQPHBnGkWk90edL-6lwvJL-pS79ArEOhpGSlFJJ8gj7MzLVD1VL51BNCdIHfahmxTw6Q1TaCGjKoLu5fha7a2QtTsI-Wd_ePTj6ufDggTjE-V2Lcx9bMaqYldqMriRqN6t7PS03r0tFsYqz80-Ymcvn8HKWaqrKo_B8q_WcvyTPsRKGYokKkPcV6cnqNXlhyE01ud-QygCCGkDQFhC0Cwj6FeHwjS7AQAEMtAMGasBAl2CgTU0NGKgBw1tysbd7_mPf1nM87Cmch43NWZhEAhTpwA3KoCzSwkuxDWbMSlfkhRQ-98ogcmXky6TEpOaQiUL4bhFEXpky9o70q7qS7wkVaRLHaIZjEym_BGNdgp7FPeHyQvA83SBbKwTMpqpnS-bhKMok9TbIZ0PRDF_deWb6dnfY8OFvvvSRPFui-BPpN7NbuQkKapNvaaTcA7Goitc
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Advances+in+Natural+Computation&rft.au=Rameshkumar%2C+K.&rft.au=Suresh%2C+R.+K.&rft.au=Mohanasundaram%2C+K.+M.&rft.atitle=Discrete+Particle+Swarm+Optimization+%28DPSO%29+Algorithm+for+Permutation+Flowshop+Scheduling+to+Minimize+Makespan&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2005-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.isbn=9783540283201&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=572&rft.epage=581&rft_id=info:doi/10.1007%2F11539902_70
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon