Improved disjunctive programming approach with Tabu search algorithm in shop scheduling problem

Scheduling is the assignment of different resources with the intention of organising and managing to discover an optimisation in the work process. The emergence of job shop scheduling problems has a significant impact on many industries, particularly manufacturing because these problems have an impa...

Full description

Saved in:
Bibliographic Details
Main Authors: Nordin, S. Z., Saipol, H. F. S., Johar, F.
Format: Conference Proceeding
Language:English
Subjects:
Heuristic methods
Job shop scheduling
Manufacturing
Productivity
Profitability
Programming
Search algorithms
Tabu search
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue 1
container_start_page
container_title
container_volume 2895
creator Nordin, S. Z.
Saipol, H. F. S.
Johar, F.
description Scheduling is the assignment of different resources with the intention of organising and managing to discover an optimisation in the work process. The emergence of job shop scheduling problems has a significant impact on many industries, particularly manufacturing because these problems have an impact on the sector's productivity and profitability. It is crucial to improve the approach taken to solve the job shop scheduling problem in order to maximise manufacturing productivity and reduce costs. The tabu search algorithm, one of the metaheuristic techniques, has been chosen to improve the disjunctive programming strategy used to solve the job shop scheduling problem. Disjunctive programming is solved using the Lingo software provides the initial solution. Then, by swapping the jobs on critical paths, the neighborhood structure's makespan value is improved. The makespan value has been improved by 24% over the initial solution.
doi_str_mv 10.1063/5.0192114
format conference_proceeding
fullrecord <record><control><sourceid>proquest_scita</sourceid><recordid>TN_cdi_proquest_journals_2939405133</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2939405133</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1684-80d7b31bcfd1f5bdc66a06827802b02ebc955bccb88ec164718240ea2c851c643</originalsourceid><addsrcrecordid>eNotkEtLAzEUhYMoWKsL_0HAnTA1N6_JLKVoLRTcVHAXkkzaSZmXk5mK_96UdnU5H-fcAwehRyALIJK9iAWBggLwKzQDISDLJchrNCOk4Bnl7PsW3cV4IIQWea5mSK-bfuiOvsRliIepdWM4epzQfjBNE9o9Nn1SxlX4N4wV3ho74ejNkICp992QYINDi2PV9Ti6ypdTfYqlkK19c49udqaO_uFy5-jr_W27_Mg2n6v18nWT9SAVzxQpc8vAul0JO2FLJ6UhUtFcEWoJ9dYVQljnrFLegeQ5KMqJN9QpAU5yNkdP57-p92fycdSHbhraVKlpwQpOBDCWXM9nV3RhNGPoWt0PoTHDnwaiTwNqoS8Dsn_fUmOS</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>2939405133</pqid></control><display><type>conference_proceeding</type><title>Improved disjunctive programming approach with Tabu search algorithm in shop scheduling problem</title><source>American Institute of Physics:Jisc Collections:Transitional Journals Agreement 2021-23 (Reading list)</source><creator>Nordin, S. Z. ; Saipol, H. F. S. ; Johar, F.</creator><contributor>Hamid, Mohd Rashid Ab ; Satari, Siti Zanariah ; Nasir, Nadirah Mohd ; Yusof, Yuhani ; Jusoh, Rahimah</contributor><creatorcontrib>Nordin, S. Z. ; Saipol, H. F. S. ; Johar, F. ; Hamid, Mohd Rashid Ab ; Satari, Siti Zanariah ; Nasir, Nadirah Mohd ; Yusof, Yuhani ; Jusoh, Rahimah</creatorcontrib><description>Scheduling is the assignment of different resources with the intention of organising and managing to discover an optimisation in the work process. The emergence of job shop scheduling problems has a significant impact on many industries, particularly manufacturing because these problems have an impact on the sector's productivity and profitability. It is crucial to improve the approach taken to solve the job shop scheduling problem in order to maximise manufacturing productivity and reduce costs. The tabu search algorithm, one of the metaheuristic techniques, has been chosen to improve the disjunctive programming strategy used to solve the job shop scheduling problem. Disjunctive programming is solved using the Lingo software provides the initial solution. Then, by swapping the jobs on critical paths, the neighborhood structure's makespan value is improved. The makespan value has been improved by 24% over the initial solution.</description><identifier>ISSN: 0094-243X</identifier><identifier>EISSN: 1551-7616</identifier><identifier>DOI: 10.1063/5.0192114</identifier><identifier>CODEN: APCPCS</identifier><language>eng</language><publisher>Melville: American Institute of Physics</publisher><subject>Heuristic methods ; Job shop scheduling ; Manufacturing ; Productivity ; Profitability ; Programming ; Search algorithms ; Tabu search</subject><ispartof>AIP Conference Proceedings, 2024, Vol.2895 (1)</ispartof><rights>Author(s)</rights><rights>2024 Author(s). Published by AIP Publishing.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,314,780,784,789,790,23930,23931,25140,27924,27925</link.rule.ids></links><search><contributor>Hamid, Mohd Rashid Ab</contributor><contributor>Satari, Siti Zanariah</contributor><contributor>Nasir, Nadirah Mohd</contributor><contributor>Yusof, Yuhani</contributor><contributor>Jusoh, Rahimah</contributor><creatorcontrib>Nordin, S. Z.</creatorcontrib><creatorcontrib>Saipol, H. F. S.</creatorcontrib><creatorcontrib>Johar, F.</creatorcontrib><title>Improved disjunctive programming approach with Tabu search algorithm in shop scheduling problem</title><title>AIP Conference Proceedings</title><description>Scheduling is the assignment of different resources with the intention of organising and managing to discover an optimisation in the work process. The emergence of job shop scheduling problems has a significant impact on many industries, particularly manufacturing because these problems have an impact on the sector's productivity and profitability. It is crucial to improve the approach taken to solve the job shop scheduling problem in order to maximise manufacturing productivity and reduce costs. The tabu search algorithm, one of the metaheuristic techniques, has been chosen to improve the disjunctive programming strategy used to solve the job shop scheduling problem. Disjunctive programming is solved using the Lingo software provides the initial solution. Then, by swapping the jobs on critical paths, the neighborhood structure's makespan value is improved. The makespan value has been improved by 24% over the initial solution.</description><subject>Heuristic methods</subject><subject>Job shop scheduling</subject><subject>Manufacturing</subject><subject>Productivity</subject><subject>Profitability</subject><subject>Programming</subject><subject>Search algorithms</subject><subject>Tabu search</subject><issn>0094-243X</issn><issn>1551-7616</issn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2024</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkEtLAzEUhYMoWKsL_0HAnTA1N6_JLKVoLRTcVHAXkkzaSZmXk5mK_96UdnU5H-fcAwehRyALIJK9iAWBggLwKzQDISDLJchrNCOk4Bnl7PsW3cV4IIQWea5mSK-bfuiOvsRliIepdWM4epzQfjBNE9o9Nn1SxlX4N4wV3ho74ejNkICp992QYINDi2PV9Ti6ypdTfYqlkK19c49udqaO_uFy5-jr_W27_Mg2n6v18nWT9SAVzxQpc8vAul0JO2FLJ6UhUtFcEWoJ9dYVQljnrFLegeQ5KMqJN9QpAU5yNkdP57-p92fycdSHbhraVKlpwQpOBDCWXM9nV3RhNGPoWt0PoTHDnwaiTwNqoS8Dsn_fUmOS</recordid><startdate>20240307</startdate><enddate>20240307</enddate><creator>Nordin, S. Z.</creator><creator>Saipol, H. F. S.</creator><creator>Johar, F.</creator><general>American Institute of Physics</general><scope>8FD</scope><scope>H8D</scope><scope>L7M</scope></search><sort><creationdate>20240307</creationdate><title>Improved disjunctive programming approach with Tabu search algorithm in shop scheduling problem</title><author>Nordin, S. Z. ; Saipol, H. F. S. ; Johar, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1684-80d7b31bcfd1f5bdc66a06827802b02ebc955bccb88ec164718240ea2c851c643</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Heuristic methods</topic><topic>Job shop scheduling</topic><topic>Manufacturing</topic><topic>Productivity</topic><topic>Profitability</topic><topic>Programming</topic><topic>Search algorithms</topic><topic>Tabu search</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nordin, S. Z.</creatorcontrib><creatorcontrib>Saipol, H. F. S.</creatorcontrib><creatorcontrib>Johar, F.</creatorcontrib><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nordin, S. Z.</au><au>Saipol, H. F. S.</au><au>Johar, F.</au><au>Hamid, Mohd Rashid Ab</au><au>Satari, Siti Zanariah</au><au>Nasir, Nadirah Mohd</au><au>Yusof, Yuhani</au><au>Jusoh, Rahimah</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Improved disjunctive programming approach with Tabu search algorithm in shop scheduling problem</atitle><btitle>AIP Conference Proceedings</btitle><date>2024-03-07</date><risdate>2024</risdate><volume>2895</volume><issue>1</issue><issn>0094-243X</issn><eissn>1551-7616</eissn><coden>APCPCS</coden><abstract>Scheduling is the assignment of different resources with the intention of organising and managing to discover an optimisation in the work process. The emergence of job shop scheduling problems has a significant impact on many industries, particularly manufacturing because these problems have an impact on the sector's productivity and profitability. It is crucial to improve the approach taken to solve the job shop scheduling problem in order to maximise manufacturing productivity and reduce costs. The tabu search algorithm, one of the metaheuristic techniques, has been chosen to improve the disjunctive programming strategy used to solve the job shop scheduling problem. Disjunctive programming is solved using the Lingo software provides the initial solution. Then, by swapping the jobs on critical paths, the neighborhood structure's makespan value is improved. The makespan value has been improved by 24% over the initial solution.</abstract><cop>Melville</cop><pub>American Institute of Physics</pub><doi>10.1063/5.0192114</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0094-243X
ispartof AIP Conference Proceedings, 2024, Vol.2895 (1)
issn 0094-243X
1551-7616
language eng
recordid cdi_proquest_journals_2939405133
source American Institute of Physics:Jisc Collections:Transitional Journals Agreement 2021-23 (Reading list)
subjects Heuristic methods
Job shop scheduling
Manufacturing
Productivity
Profitability
Programming
Search algorithms
Tabu search
title Improved disjunctive programming approach with Tabu search algorithm in shop scheduling problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T16%3A01%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_scita&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Improved%20disjunctive%20programming%20approach%20with%20Tabu%20search%20algorithm%20in%20shop%20scheduling%20problem&rft.btitle=AIP%20Conference%20Proceedings&rft.au=Nordin,%20S.%20Z.&rft.date=2024-03-07&rft.volume=2895&rft.issue=1&rft.issn=0094-243X&rft.eissn=1551-7616&rft.coden=APCPCS&rft_id=info:doi/10.1063/5.0192114&rft_dat=%3Cproquest_scita%3E2939405133%3C/proquest_scita%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-p1684-80d7b31bcfd1f5bdc66a06827802b02ebc955bccb88ec164718240ea2c851c643%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2939405133&rft_id=info:pmid/&rfr_iscdi=true