Scheduling Single Machine Problem to Minimize Completion Time

In this research, a single batch machine scheduling problem with sequence dependent setup time is studied with the aim of minimizing the completion time. This problem has been proven to be NP-hard and therefore, a tabu search algorithm is developed to solve the single batch machine scheduling proble...

Full description

Saved in:
Bibliographic Details
Published in:TEM Journal 2022-05, Vol.11 (2), p.552-556
Main Authors: Suppiah, Yasothei, Bhuvaneswari, Thangavel, Shen Yee, Pang, Wei Yue, Ng, Mun Horng, Chan
Format: Article
Language:English
Subjects:
Business Economy / Management
Completion time
Genetic algorithms
Heuristic
Linear programming
Multimedia
Mutation
Neighborhoods
Population
Production planning
Schedules
Scheduling
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c247t-d6657d5fa4cbc04568f39357bc4e81706018880ff8e79f189254f435b08d011d3
cites
container_end_page 556
container_issue 2
container_start_page 552
container_title TEM Journal
container_volume 11
creator Suppiah, Yasothei
Bhuvaneswari, Thangavel
Shen Yee, Pang
Wei Yue, Ng
Mun Horng, Chan
description In this research, a single batch machine scheduling problem with sequence dependent setup time is studied with the aim of minimizing the completion time. This problem has been proven to be NP-hard and therefore, a tabu search algorithm is developed to solve the single batch machine scheduling problem. Furthermore, a genetic algorithm and several dispatching heuristics are also developed to study the capabilities of all the algorithms in providing the average completion time. The computational result reveals that the developed tabu search algorithm is capable of producing a better outcome compared to the other algorithms.
doi_str_mv 10.18421/TEM112-08
format article
fullrecord <record><control><sourceid>ceeol_cross</sourceid><recordid>TN_cdi_ceeol_journals_1045854</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ceeol_id>1045854</ceeol_id><sourcerecordid>1045854</sourcerecordid><originalsourceid>FETCH-LOGICAL-c247t-d6657d5fa4cbc04568f39357bc4e81706018880ff8e79f189254f435b08d011d3</originalsourceid><addsrcrecordid>eNpFkEtLw0AUhQdRsNRu3AsD7oTonVfmZuFCSn1Ag0Lreshjxk5JMnWSLvTXG2zRzbln8XHu4RByyeCWoeTsbr3IGeMJ4AmZcM50gkKI0z8P2TmZ9f0WAJhOpVByQu5X1cbW-8Z3H3Q1SmNpXlQb31n6FkPZ2JYOgea-863_tnQe2l1jBx86uvatvSBnrmh6OzveKXl_XKznz8ny9ell_rBMKi71kNRpqnStXCGrsgKpUnQiE0qXlbTINKTAEBGcQ6szxzDjSrqxXwlYA2O1mJLrQ-4uhs-97QezDfvYjS8N1yBRKcH1SN0cqCqGvo_WmV30bRG_DAPzu5A5LGQAR_jqCFsbmv88NvZDJcUPQvJfeg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2704855327</pqid></control><display><type>article</type><title>Scheduling Single Machine Problem to Minimize Completion Time</title><source>Publicly Available Content Database</source><creator>Suppiah, Yasothei ; Bhuvaneswari, Thangavel ; Shen Yee, Pang ; Wei Yue, Ng ; Mun Horng, Chan</creator><creatorcontrib>Suppiah, Yasothei ; Bhuvaneswari, Thangavel ; Shen Yee, Pang ; Wei Yue, Ng ; Mun Horng, Chan</creatorcontrib><description>In this research, a single batch machine scheduling problem with sequence dependent setup time is studied with the aim of minimizing the completion time. This problem has been proven to be NP-hard and therefore, a tabu search algorithm is developed to solve the single batch machine scheduling problem. Furthermore, a genetic algorithm and several dispatching heuristics are also developed to study the capabilities of all the algorithms in providing the average completion time. The computational result reveals that the developed tabu search algorithm is capable of producing a better outcome compared to the other algorithms.</description><identifier>ISSN: 2217-8309</identifier><identifier>EISSN: 2217-8333</identifier><identifier>DOI: 10.18421/TEM112-08</identifier><language>eng</language><publisher>Novi Pazar: UIKTEN - Association for Information Communication Technology Education and Science</publisher><subject>Business Economy / Management ; Completion time ; Genetic algorithms ; Heuristic ; Linear programming ; Multimedia ; Mutation ; Neighborhoods ; Population ; Production planning ; Schedules ; Scheduling</subject><ispartof>TEM Journal, 2022-05, Vol.11 (2), p.552-556</ispartof><rights>2022. This work is published under https://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c247t-d6657d5fa4cbc04568f39357bc4e81706018880ff8e79f189254f435b08d011d3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://www.ceeol.com//api/image/getissuecoverimage?id=picture_2022_67783.jpg</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2704855327?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,25753,27924,27925,37012,44590</link.rule.ids></links><search><creatorcontrib>Suppiah, Yasothei</creatorcontrib><creatorcontrib>Bhuvaneswari, Thangavel</creatorcontrib><creatorcontrib>Shen Yee, Pang</creatorcontrib><creatorcontrib>Wei Yue, Ng</creatorcontrib><creatorcontrib>Mun Horng, Chan</creatorcontrib><title>Scheduling Single Machine Problem to Minimize Completion Time</title><title>TEM Journal</title><addtitle>TEM Journal</addtitle><description>In this research, a single batch machine scheduling problem with sequence dependent setup time is studied with the aim of minimizing the completion time. This problem has been proven to be NP-hard and therefore, a tabu search algorithm is developed to solve the single batch machine scheduling problem. Furthermore, a genetic algorithm and several dispatching heuristics are also developed to study the capabilities of all the algorithms in providing the average completion time. The computational result reveals that the developed tabu search algorithm is capable of producing a better outcome compared to the other algorithms.</description><subject>Business Economy / Management</subject><subject>Completion time</subject><subject>Genetic algorithms</subject><subject>Heuristic</subject><subject>Linear programming</subject><subject>Multimedia</subject><subject>Mutation</subject><subject>Neighborhoods</subject><subject>Population</subject><subject>Production planning</subject><subject>Schedules</subject><subject>Scheduling</subject><issn>2217-8309</issn><issn>2217-8333</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpFkEtLw0AUhQdRsNRu3AsD7oTonVfmZuFCSn1Ag0Lreshjxk5JMnWSLvTXG2zRzbln8XHu4RByyeCWoeTsbr3IGeMJ4AmZcM50gkKI0z8P2TmZ9f0WAJhOpVByQu5X1cbW-8Z3H3Q1SmNpXlQb31n6FkPZ2JYOgea-863_tnQe2l1jBx86uvatvSBnrmh6OzveKXl_XKznz8ny9ell_rBMKi71kNRpqnStXCGrsgKpUnQiE0qXlbTINKTAEBGcQ6szxzDjSrqxXwlYA2O1mJLrQ-4uhs-97QezDfvYjS8N1yBRKcH1SN0cqCqGvo_WmV30bRG_DAPzu5A5LGQAR_jqCFsbmv88NvZDJcUPQvJfeg</recordid><startdate>20220501</startdate><enddate>20220501</enddate><creator>Suppiah, Yasothei</creator><creator>Bhuvaneswari, Thangavel</creator><creator>Shen Yee, Pang</creator><creator>Wei Yue, Ng</creator><creator>Mun Horng, Chan</creator><general>UIKTEN - Association for Information Communication Technology Education and Science</general><scope>AE2</scope><scope>BIXPP</scope><scope>REL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20220501</creationdate><title>Scheduling Single Machine Problem to Minimize Completion Time</title><author>Suppiah, Yasothei ; Bhuvaneswari, Thangavel ; Shen Yee, Pang ; Wei Yue, Ng ; Mun Horng, Chan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c247t-d6657d5fa4cbc04568f39357bc4e81706018880ff8e79f189254f435b08d011d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Business Economy / Management</topic><topic>Completion time</topic><topic>Genetic algorithms</topic><topic>Heuristic</topic><topic>Linear programming</topic><topic>Multimedia</topic><topic>Mutation</topic><topic>Neighborhoods</topic><topic>Population</topic><topic>Production planning</topic><topic>Schedules</topic><topic>Scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Suppiah, Yasothei</creatorcontrib><creatorcontrib>Bhuvaneswari, Thangavel</creatorcontrib><creatorcontrib>Shen Yee, Pang</creatorcontrib><creatorcontrib>Wei Yue, Ng</creatorcontrib><creatorcontrib>Mun Horng, Chan</creatorcontrib><collection>Central and Eastern European Online Library (C.E.E.O.L.) (DFG Nationallizenzen)</collection><collection>CEEOL: Open Access</collection><collection>Central and Eastern European Online Library - CEEOL Journals</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>TEM Journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Suppiah, Yasothei</au><au>Bhuvaneswari, Thangavel</au><au>Shen Yee, Pang</au><au>Wei Yue, Ng</au><au>Mun Horng, Chan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scheduling Single Machine Problem to Minimize Completion Time</atitle><jtitle>TEM Journal</jtitle><addtitle>TEM Journal</addtitle><date>2022-05-01</date><risdate>2022</risdate><volume>11</volume><issue>2</issue><spage>552</spage><epage>556</epage><pages>552-556</pages><issn>2217-8309</issn><eissn>2217-8333</eissn><abstract>In this research, a single batch machine scheduling problem with sequence dependent setup time is studied with the aim of minimizing the completion time. This problem has been proven to be NP-hard and therefore, a tabu search algorithm is developed to solve the single batch machine scheduling problem. Furthermore, a genetic algorithm and several dispatching heuristics are also developed to study the capabilities of all the algorithms in providing the average completion time. The computational result reveals that the developed tabu search algorithm is capable of producing a better outcome compared to the other algorithms.</abstract><cop>Novi Pazar</cop><pub>UIKTEN - Association for Information Communication Technology Education and Science</pub><doi>10.18421/TEM112-08</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2217-8309
ispartof TEM Journal, 2022-05, Vol.11 (2), p.552-556
issn 2217-8309
2217-8333
language eng
recordid cdi_ceeol_journals_1045854
source Publicly Available Content Database
subjects Business Economy / Management
Completion time
Genetic algorithms
Heuristic
Linear programming
Multimedia
Mutation
Neighborhoods
Population
Production planning
Schedules
Scheduling
title Scheduling Single Machine Problem to Minimize Completion Time
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T22%3A39%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ceeol_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Scheduling%20Single%20Machine%20Problem%20to%20Minimize%20Completion%20Time&rft.jtitle=TEM%20Journal&rft.au=Suppiah,%20Yasothei&rft.date=2022-05-01&rft.volume=11&rft.issue=2&rft.spage=552&rft.epage=556&rft.pages=552-556&rft.issn=2217-8309&rft.eissn=2217-8333&rft_id=info:doi/10.18421/TEM112-08&rft_dat=%3Cceeol_cross%3E1045854%3C/ceeol_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c247t-d6657d5fa4cbc04568f39357bc4e81706018880ff8e79f189254f435b08d011d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2704855327&rft_id=info:pmid/&rft_ceeol_id=1045854&rfr_iscdi=true