Heuristics Algorithms for Job-Shop Scheduling Problem: Critical Element Analysis

Solving JSSP is an intractable subject. It has great significance in improving productive efficiencies for manufacture enterprise. In recent decades, designing algorithms for solving problem of JSSP problem become an important issue. Moreover, it is difficult to find an appropriate criteria to evalu...

Full description

Saved in:
Bibliographic Details
Published in2012 International Conference on Computer Science and Service System pp. 94 - 97
Main Authors Sun Liang, Wang Xiao-Yuan, Zhang Yun-Cai
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2012
Subjects
Algorithm design and analysis
Genetic algorithms
Heuristic algorithms
Heuristics algorithm
Job shop scheduling
job-shop scheduling problem
Optimization
Processor scheduling
scheduling theory
Online AccessGet full text
ISBN9781467307215
1467307211
DOI10.1109/CSSS.2012.32

Cover

Abstract Solving JSSP is an intractable subject. It has great significance in improving productive efficiencies for manufacture enterprise. In recent decades, designing algorithms for solving problem of JSSP problem become an important issue. Moreover, it is difficult to find an appropriate criteria to evaluate efficiency of algorithms available with respect to solving JSSP. Various algorithms for solving JSSP are listed, and their advantages and disadvantages are also indicated. At the same time, three critical element for designing algorithms for JSSP were proposed. Finally, several future research trends of solving job shop problems and proposals for the future research work are summarized and presented respectively.
AbstractList Solving JSSP is an intractable subject. It has great significance in improving productive efficiencies for manufacture enterprise. In recent decades, designing algorithms for solving problem of JSSP problem become an important issue. Moreover, it is difficult to find an appropriate criteria to evaluate efficiency of algorithms available with respect to solving JSSP. Various algorithms for solving JSSP are listed, and their advantages and disadvantages are also indicated. At the same time, three critical element for designing algorithms for JSSP were proposed. Finally, several future research trends of solving job shop problems and proposals for the future research work are summarized and presented respectively.
Author Zhang Yun-Cai
Wang Xiao-Yuan
Sun Liang
Author_xml – sequence: 1
  surname: Sun Liang
  fullname: Sun Liang
  email: liangsunsdut@sdut.edu.cn
  organization: Sch. of Transp. & Vehicle Eng., Shandong Univ. of Technol., Zibo, China
– sequence: 2
  surname: Wang Xiao-Yuan
  fullname: Wang Xiao-Yuan
  organization: Sch. of Transp. & Vehicle Eng., Shandong Univ. of Technol., Zibo, China
– sequence: 3
  surname: Zhang Yun-Cai
  fullname: Zhang Yun-Cai
  email: liangsunsdut@sdut.edu.cn
  organization: Tianjin Key Lab. of Pulp & Paper Eng., Tianjin Univ. of Sci. & Technol., Tianjin, China
BookMark eNotjj1PwzAYhI0ACSjZ2Fj8BxL82k5ss1VRoaBKVDJ7ZRunMcpHZadD_z0pMJ2e093p7tDVMA4eoQcgBQBRT7XWuqAEaMHoBcqUkERUquQCFLn8ZeCVYERQKG9QltI3IWRuVkLSW7Rd-2MMaQou4WW3H2OY2j7hZoz4fbS5bscD1q71X8cuDHu8jaPtfP-M6zkYnOnwakY_THg5mO6UQrpH143pks_-dYH0y-qzXuebj9e3ernJgyJTXirFwVFLGRhDuXKN9GBhvghGVo4oSp1k59PcV2cHGtlYKy1rWOkMW6DHv9Xgvd8dYuhNPO0qpjgVhP0AHCRQmw
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CSSS.2012.32
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9780769547190
0769547192
EndPage 97
ExternalDocumentID 6394270
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-59941c2b231aa249cf8e1b12151a86c0922c8330724e6a86c1f8fbb8b3f35ca3
IEDL.DBID RIE
ISBN 9781467307215
1467307211
IngestDate Wed Aug 27 03:42:59 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-59941c2b231aa249cf8e1b12151a86c0922c8330724e6a86c1f8fbb8b3f35ca3
PageCount 4
ParticipantIDs ieee_primary_6394270
PublicationCentury 2000
PublicationDate 2012-Aug.
PublicationDateYYYYMMDD 2012-08-01
PublicationDate_xml – month: 08
  year: 2012
  text: 2012-Aug.
PublicationDecade 2010
PublicationTitle 2012 International Conference on Computer Science and Service System
PublicationTitleAbbrev csss
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001106782
Score 1.4958099
Snippet Solving JSSP is an intractable subject. It has great significance in improving productive efficiencies for manufacture enterprise. In recent decades, designing...
SourceID ieee
SourceType Publisher
StartPage 94
SubjectTerms Algorithm design and analysis
Genetic algorithms
Heuristic algorithms
Heuristics algorithm
Job shop scheduling
job-shop scheduling problem
Optimization
Processor scheduling
scheduling theory
Title Heuristics Algorithms for Job-Shop Scheduling Problem: Critical Element Analysis
URI https://ieeexplore.ieee.org/document/6394270
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NS8MwFA9zJ08qm_hNDh5N1yZplnqTsTEGk0EVdhtJmm5DXcdsL_715vVjE_HgrQk0hPcKLy_9fSB0T2UiZSgt0TzghEdUEq0CRrhSibIitT4FcvL0WYxf-WQezlvoYc-FsdaW4DPrwWP5Lz_JTAFXZT1XTTntuwb9qC9FxdU63KeAFpqkJXdLuM8WOptG0qkeh3vge9QbxHEMwC7qgfHID2OVsq6MTtC02VEFJ3nzilx75uuXWON_t3yKugcGH57ta9MZatlNB83GtqiFmfHT-zLbrfPVxyd2x1Y8yTSJV9kWxy6JCaDTl_A-eM084sYOAQ8rrDlulEy6KB4NXwZjUjsqkHXk5ySMIh4Yqt2ZTinXd5lU2kCDvkSgpDB-RKmRDGLFrYCZIJWp1lKzlIVGsXPU3mQbe4EwC12tTyhTAZDp3Tp-pLg1oS9UIpiwl6gDsVhsK8mMRR2Gq7-nr9ExpKLC1d2gdr4r7K2r9bm-K5P8DdD4pVc
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3LT8IwGG-IHvSkBoxve_Box9bH7LwZApkIhGSYcCNt1wFRGcHt4l9vuwcY48Hb2mRN831Lvn7d7wHAHeYx54xrJKlHEQ0wR1J4BFEhYqH9RLvYkpOHIz98pf0pmzbA_ZYLo7UuwGfasY_Fv_w4Vbm9Kmubakrxg2nQ9xmllJVsrd2NilVD47hgb_nmw7W9TS3qVI3ZFvoetDtRFFloF3as9cgPa5WisvSOwLDeUwkoeXPyTDrq65dc4383fQxaOw4fHG-r0wlo6FUTjEOdV9LM8Ol9nm6W2eLjE5qDK-ynEkWLdA0jk8bY4tPn9n3rNvMIa0ME2C3R5rDWMmmBqNeddEJUeSqgZeBmiAUB9RSW5lQnhOm8VMK1J63ChCe4r9wAY8WJjRXVvp3xEp5IySVJCFOCnIK9VbrSZwASZqp9jInwLJ3erOMGgmrFXF_EPvH1OWjaWMzWpWjGrArDxd_Tt-AgnAwHs8Hz6OUSHNq0lCi7K7CXbXJ9bSp_Jm-KhH8Drx-opA
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=proceeding&rft.title=2012+International+Conference+on+Computer+Science+and+Service+System&rft.atitle=Heuristics+Algorithms+for+Job-Shop+Scheduling+Problem%3A+Critical+Element+Analysis&rft.au=Sun+Liang&rft.au=Wang+Xiao-Yuan&rft.au=Zhang+Yun-Cai&rft.date=2012-08-01&rft.pub=IEEE&rft.isbn=9781467307215&rft.spage=94&rft.epage=97&rft_id=info:doi/10.1109%2FCSSS.2012.32&rft.externalDocID=6394270
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467307215/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467307215/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467307215/sc.gif&client=summon&freeimage=true