A modified simulated annealing method for flexible job shop scheduling problem

The problem considered in this paper is an important extension of the classical job shop scheduling problem, where the same operation can be performed on more than one machine. The problem is to assign each operation to a machine and to sequence the operations on the machines, such that the makespan...

Full description

Saved in:
Bibliographic Details
Main Authors: Najid, N.M., Dauzere-Peres, S., Zaidat, A.
Format: Conference Proceeding
Language:English
Subjects:
Job shop scheduling
Polynomials
Routing
Search methods
Simulated annealing
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c237t-f2f24100842335f45174389e22245fb05e792842d3ba580857aad703497bb8cb3
cites
container_end_page
container_issue
container_start_page 6 pp. vol.5
container_title
container_volume 5
creator Najid, N.M.
Dauzere-Peres, S.
Zaidat, A.
description The problem considered in this paper is an important extension of the classical job shop scheduling problem, where the same operation can be performed on more than one machine. The problem is to assign each operation to a machine and to sequence the operations on the machines, such that the makespan of a set of jobs Is minimized. A generalized job shop problem is defined in detail. A variation of the simulated annealing method is proposed and computational results are provided.
doi_str_mv 10.1109/ICSMC.2002.1176334
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_1176334</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1176334</ieee_id><sourcerecordid>1176334</sourcerecordid><originalsourceid>FETCH-LOGICAL-c237t-f2f24100842335f45174389e22245fb05e792842d3ba580857aad703497bb8cb3</originalsourceid><addsrcrecordid>eNotUMtOwzAQtHhIpIUfgIt_IGW9tmPnWEVQKhU4ABK3yk5s4iovxakEf08EPc2MZma1GkJuGawYg_x-W7w9FysEwFmrjHNxRhKUSqUsk_KcLEBp4EpwxS5IwiDDNEf8vCKLGA9zCwTTCXlZ07avgg-uojG0x8ZMMzNd50wTui_auqnuK-r7kfrGfQfbOHroLY11P9BY1q46_uWGsZ-t9ppcetNEd3PCJfl4fHgvntLd62ZbrHdpiVxNqUePggFogZxLLySb_9S5Q0QhvQXpVI6zWXFrpAYtlTGVAi5yZa0uLV-Su_-7wTm3H8bQmvFnf9qB_wIzWE8G</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A modified simulated annealing method for flexible job shop scheduling problem</title><source>IEEE Xplore All Conference Series</source><creator>Najid, N.M. ; Dauzere-Peres, S. ; Zaidat, A.</creator><creatorcontrib>Najid, N.M. ; Dauzere-Peres, S. ; Zaidat, A.</creatorcontrib><description>The problem considered in this paper is an important extension of the classical job shop scheduling problem, where the same operation can be performed on more than one machine. The problem is to assign each operation to a machine and to sequence the operations on the machines, such that the makespan of a set of jobs Is minimized. A generalized job shop problem is defined in detail. A variation of the simulated annealing method is proposed and computational results are provided.</description><identifier>ISSN: 1062-922X</identifier><identifier>ISBN: 0780374371</identifier><identifier>ISBN: 9780780374379</identifier><identifier>EISSN: 2577-1655</identifier><identifier>DOI: 10.1109/ICSMC.2002.1176334</identifier><language>eng</language><publisher>IEEE</publisher><subject>Job shop scheduling ; Polynomials ; Routing ; Search methods ; Simulated annealing</subject><ispartof>IEEE International Conference on Systems, Man and Cybernetics, 2002, Vol.5, p.6 pp. vol.5</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c237t-f2f24100842335f45174389e22245fb05e792842d3ba580857aad703497bb8cb3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1176334$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,4049,4050,23929,23930,25139,27924,54554,54931</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1176334$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Najid, N.M.</creatorcontrib><creatorcontrib>Dauzere-Peres, S.</creatorcontrib><creatorcontrib>Zaidat, A.</creatorcontrib><title>A modified simulated annealing method for flexible job shop scheduling problem</title><title>IEEE International Conference on Systems, Man and Cybernetics</title><addtitle>ICSMC</addtitle><description>The problem considered in this paper is an important extension of the classical job shop scheduling problem, where the same operation can be performed on more than one machine. The problem is to assign each operation to a machine and to sequence the operations on the machines, such that the makespan of a set of jobs Is minimized. A generalized job shop problem is defined in detail. A variation of the simulated annealing method is proposed and computational results are provided.</description><subject>Job shop scheduling</subject><subject>Polynomials</subject><subject>Routing</subject><subject>Search methods</subject><subject>Simulated annealing</subject><issn>1062-922X</issn><issn>2577-1655</issn><isbn>0780374371</isbn><isbn>9780780374379</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2002</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotUMtOwzAQtHhIpIUfgIt_IGW9tmPnWEVQKhU4ABK3yk5s4iovxakEf08EPc2MZma1GkJuGawYg_x-W7w9FysEwFmrjHNxRhKUSqUsk_KcLEBp4EpwxS5IwiDDNEf8vCKLGA9zCwTTCXlZ07avgg-uojG0x8ZMMzNd50wTui_auqnuK-r7kfrGfQfbOHroLY11P9BY1q46_uWGsZ-t9ppcetNEd3PCJfl4fHgvntLd62ZbrHdpiVxNqUePggFogZxLLySb_9S5Q0QhvQXpVI6zWXFrpAYtlTGVAi5yZa0uLV-Su_-7wTm3H8bQmvFnf9qB_wIzWE8G</recordid><startdate>2002</startdate><enddate>2002</enddate><creator>Najid, N.M.</creator><creator>Dauzere-Peres, S.</creator><creator>Zaidat, A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2002</creationdate><title>A modified simulated annealing method for flexible job shop scheduling problem</title><author>Najid, N.M. ; Dauzere-Peres, S. ; Zaidat, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c237t-f2f24100842335f45174389e22245fb05e792842d3ba580857aad703497bb8cb3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Job shop scheduling</topic><topic>Polynomials</topic><topic>Routing</topic><topic>Search methods</topic><topic>Simulated annealing</topic><toplevel>online_resources</toplevel><creatorcontrib>Najid, N.M.</creatorcontrib><creatorcontrib>Dauzere-Peres, S.</creatorcontrib><creatorcontrib>Zaidat, A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Najid, N.M.</au><au>Dauzere-Peres, S.</au><au>Zaidat, A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A modified simulated annealing method for flexible job shop scheduling problem</atitle><btitle>IEEE International Conference on Systems, Man and Cybernetics</btitle><stitle>ICSMC</stitle><date>2002</date><risdate>2002</risdate><volume>5</volume><spage>6 pp. vol.5</spage><pages>6 pp. vol.5-</pages><issn>1062-922X</issn><eissn>2577-1655</eissn><isbn>0780374371</isbn><isbn>9780780374379</isbn><abstract>The problem considered in this paper is an important extension of the classical job shop scheduling problem, where the same operation can be performed on more than one machine. The problem is to assign each operation to a machine and to sequence the operations on the machines, such that the makespan of a set of jobs Is minimized. A generalized job shop problem is defined in detail. A variation of the simulated annealing method is proposed and computational results are provided.</abstract><pub>IEEE</pub><doi>10.1109/ICSMC.2002.1176334</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1062-922X
ispartof IEEE International Conference on Systems, Man and Cybernetics, 2002, Vol.5, p.6 pp. vol.5
issn 1062-922X
2577-1655
language eng
recordid cdi_ieee_primary_1176334
source IEEE Xplore All Conference Series
subjects Job shop scheduling
Polynomials
Routing
Search methods
Simulated annealing
title A modified simulated annealing method for flexible job shop scheduling problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T17%3A18%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20modified%20simulated%20annealing%20method%20for%20flexible%20job%20shop%20scheduling%20problem&rft.btitle=IEEE%20International%20Conference%20on%20Systems,%20Man%20and%20Cybernetics&rft.au=Najid,%20N.M.&rft.date=2002&rft.volume=5&rft.spage=6%20pp.%20vol.5&rft.pages=6%20pp.%20vol.5-&rft.issn=1062-922X&rft.eissn=2577-1655&rft.isbn=0780374371&rft.isbn_list=9780780374379&rft_id=info:doi/10.1109/ICSMC.2002.1176334&rft_dat=%3Cieee_CHZPO%3E1176334%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c237t-f2f24100842335f45174389e22245fb05e792842d3ba580857aad703497bb8cb3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1176334&rfr_iscdi=true