A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem

The single machine, distinct due date, early/tardy machine scheduling problem closely models the situation faced by Just-In-Time manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the concept of a ‘compressed solution space’, based o...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1997-11, Vol.102 (3), p.513-527
Main Authors: James, R.J.W., Buchanan, J.T.
Format: Article
Language:English
Subjects:
Applied sciences
Early/tardy
Exact sciences and technology
Heuristic
Heuristics
Job shops
Operational research and scientific management
Operational research. Management science
Operations research
Production scheduling
Scheduling
Scheduling, sequencing
Studies
Tabu search
Citations: Items that this one cites
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-c431t-130240108a4ed3733fe478834a1441bdb826ee37e18c5e6faa7f4c159df518823
cites cdi_FETCH-LOGICAL-c431t-130240108a4ed3733fe478834a1441bdb826ee37e18c5e6faa7f4c159df518823
container_end_page 527
container_issue 3
container_start_page 513
container_title European journal of operational research
container_volume 102
creator James, R.J.W.
Buchanan, J.T.
description The single machine, distinct due date, early/tardy machine scheduling problem closely models the situation faced by Just-In-Time manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the concept of a ‘compressed solution space’, based on a binary representation of the early/tardy scheduling problem, and tabu search. A heuristic which simultaneously sequences and schedules the jobs is developed to perform the conversion between the compressed and physical solution spaces. Results show that the compressed solution space performs well with small problems, and is superior to standard tabu search solution spaces for large-scale, realistically sized problems.
doi_str_mv 10.1016/S0377-2217(96)00239-1
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204129876</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221796002391</els_id><sourcerecordid>43961783</sourcerecordid><originalsourceid>FETCH-LOGICAL-c431t-130240108a4ed3733fe478834a1441bdb826ee37e18c5e6faa7f4c159df518823</originalsourceid><addsrcrecordid>eNqFUE1r3DAQFSWFbtL-hIIoPSQHJxpJtuRTCCFfNJBD2muFVh7HWmzLlbwp---j3Q17jeBpBHrvzcwj5Duwc2BQXTwzoVTBOajTujpjjIu6gE9kAVrxotIVOyKLA-ULOU5pxRiDEsoF-XtFR_Qv3TKsYxdCQ5PrcED6388dtdSFYYqYEuaP0K9nH0aaJuuQtiHSuUOKNvabi9nGZrPTNuvejy90imHZ4_CVfG5tn_Dbez0hf25vfl_fF49Pdw_XV4-FkwLmAgTjkgHTVmIjlBAtSqW1kBakhGWz1LxCFApBuxKr1lrVSgdl3bQlaM3FCfmx9819_60xzWaVFxpzS8OZBF5rVWVSuSe5GFKK2Jop-sHGjQFmtkmaXZJmG5OpK7NL0kDW_drrIk7oDiLMZxVyOubVCAuM53uzfdW1ysVniIwpowRhSq5MNw_Z7ef7qDY527fRjs6ngysHKeRuo8s9DXNsrx6jSc7j6LDxEd1smuA_GPsNorKg4A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204129876</pqid></control><display><type>article</type><title>A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem</title><source>Elsevier:Jisc Collections:Elsevier Read and Publish Agreement 2022-2024:Freedom Collection (Reading list)</source><creator>James, R.J.W. ; Buchanan, J.T.</creator><creatorcontrib>James, R.J.W. ; Buchanan, J.T.</creatorcontrib><description>The single machine, distinct due date, early/tardy machine scheduling problem closely models the situation faced by Just-In-Time manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the concept of a ‘compressed solution space’, based on a binary representation of the early/tardy scheduling problem, and tabu search. A heuristic which simultaneously sequences and schedules the jobs is developed to perform the conversion between the compressed and physical solution spaces. Results show that the compressed solution space performs well with small problems, and is superior to standard tabu search solution spaces for large-scale, realistically sized problems.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(96)00239-1</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Early/tardy ; Exact sciences and technology ; Heuristic ; Heuristics ; Job shops ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Production scheduling ; Scheduling ; Scheduling, sequencing ; Studies ; Tabu search</subject><ispartof>European journal of operational research, 1997-11, Vol.102 (3), p.513-527</ispartof><rights>1997</rights><rights>1998 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Nov 1, 1997</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c431t-130240108a4ed3733fe478834a1441bdb826ee37e18c5e6faa7f4c159df518823</citedby><cites>FETCH-LOGICAL-c431t-130240108a4ed3733fe478834a1441bdb826ee37e18c5e6faa7f4c159df518823</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=2143482$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a102_3ay_3a1997_3ai_3a3_3ap_3a513-527.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>James, R.J.W.</creatorcontrib><creatorcontrib>Buchanan, J.T.</creatorcontrib><title>A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem</title><title>European journal of operational research</title><description>The single machine, distinct due date, early/tardy machine scheduling problem closely models the situation faced by Just-In-Time manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the concept of a ‘compressed solution space’, based on a binary representation of the early/tardy scheduling problem, and tabu search. A heuristic which simultaneously sequences and schedules the jobs is developed to perform the conversion between the compressed and physical solution spaces. Results show that the compressed solution space performs well with small problems, and is superior to standard tabu search solution spaces for large-scale, realistically sized problems.</description><subject>Applied sciences</subject><subject>Early/tardy</subject><subject>Exact sciences and technology</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Job shops</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Production scheduling</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><subject>Studies</subject><subject>Tabu search</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNqFUE1r3DAQFSWFbtL-hIIoPSQHJxpJtuRTCCFfNJBD2muFVh7HWmzLlbwp---j3Q17jeBpBHrvzcwj5Duwc2BQXTwzoVTBOajTujpjjIu6gE9kAVrxotIVOyKLA-ULOU5pxRiDEsoF-XtFR_Qv3TKsYxdCQ5PrcED6388dtdSFYYqYEuaP0K9nH0aaJuuQtiHSuUOKNvabi9nGZrPTNuvejy90imHZ4_CVfG5tn_Dbez0hf25vfl_fF49Pdw_XV4-FkwLmAgTjkgHTVmIjlBAtSqW1kBakhGWz1LxCFApBuxKr1lrVSgdl3bQlaM3FCfmx9819_60xzWaVFxpzS8OZBF5rVWVSuSe5GFKK2Jop-sHGjQFmtkmaXZJmG5OpK7NL0kDW_drrIk7oDiLMZxVyOubVCAuM53uzfdW1ysVniIwpowRhSq5MNw_Z7ef7qDY527fRjs6ngysHKeRuo8s9DXNsrx6jSc7j6LDxEd1smuA_GPsNorKg4A</recordid><startdate>19971101</startdate><enddate>19971101</enddate><creator>James, R.J.W.</creator><creator>Buchanan, J.T.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19971101</creationdate><title>A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem</title><author>James, R.J.W. ; Buchanan, J.T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c431t-130240108a4ed3733fe478834a1441bdb826ee37e18c5e6faa7f4c159df518823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Applied sciences</topic><topic>Early/tardy</topic><topic>Exact sciences and technology</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Job shops</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Production scheduling</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><topic>Studies</topic><topic>Tabu search</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>James, R.J.W.</creatorcontrib><creatorcontrib>Buchanan, J.T.</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>James, R.J.W.</au><au>Buchanan, J.T.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem</atitle><jtitle>European journal of operational research</jtitle><date>1997-11-01</date><risdate>1997</risdate><volume>102</volume><issue>3</issue><spage>513</spage><epage>527</epage><pages>513-527</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>The single machine, distinct due date, early/tardy machine scheduling problem closely models the situation faced by Just-In-Time manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the concept of a ‘compressed solution space’, based on a binary representation of the early/tardy scheduling problem, and tabu search. A heuristic which simultaneously sequences and schedules the jobs is developed to perform the conversion between the compressed and physical solution spaces. Results show that the compressed solution space performs well with small problems, and is superior to standard tabu search solution spaces for large-scale, realistically sized problems.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(96)00239-1</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0377-2217
ispartof European journal of operational research, 1997-11, Vol.102 (3), p.513-527
issn 0377-2217
1872-6860
language eng
recordid cdi_proquest_journals_204129876
source Elsevier:Jisc Collections:Elsevier Read and Publish Agreement 2022-2024:Freedom Collection (Reading list)
subjects Applied sciences
Early/tardy
Exact sciences and technology
Heuristic
Heuristics
Job shops
Operational research and scientific management
Operational research. Management science
Operations research
Production scheduling
Scheduling
Scheduling, sequencing
Studies
Tabu search
title A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-23T18%3A13%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20neighbourhood%20scheme%20with%20a%20compressed%20solution%20space%20for%20the%20early/tardy%20scheduling%20problem&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=James,%20R.J.W.&rft.date=1997-11-01&rft.volume=102&rft.issue=3&rft.spage=513&rft.epage=527&rft.pages=513-527&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(96)00239-1&rft_dat=%3Cproquest_cross%3E43961783%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c431t-130240108a4ed3733fe478834a1441bdb826ee37e18c5e6faa7f4c159df518823%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=204129876&rft_id=info:pmid/&rfr_iscdi=true