Single-machine sequencing with controllable processing times
We consider a static single-machine sequencing problem which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containi...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 1992-06, Vol.59 (2), p.298-302 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 302 |
|---|---|
| container_issue | 2 |
| container_start_page | 298 |
| container_title | European journal of operational research |
| container_volume | 59 |
| creator | Panwalkar, S.S. Rajagopalan, R. |
| description | We consider a static single-machine sequencing problem which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness cost, and total processing cost. |
| doi_str_mv | 10.1016/0377-2217(92)90144-X |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204125595</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>037722179290144X</els_id><sourcerecordid>1070507</sourcerecordid><originalsourceid>FETCH-LOGICAL-c427t-bdfed57f9acd08c5d20e19f087c0588945b21d61bbaf608f59aecbd6aa0a57c3</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-Aw9FPOihOkmbtgERZPGTBQ_uYW8hTaduln6ZdFf235ta2aOByQvJ-84MDyHnFG4o0OQWojQNGaPplWDXAmgch8sDMqFZysIkS-CQTPaWY3Li3BoAKKd8Qu4-TPNZYVgrvTINBg6_Ntho_xh8m34V6LbpbVtVKq8w6Gyr0bnhszc1ulNyVKrK4dmfTsni6XExewnn78-vs4d5qGOW9mFelFjwtBRKF5BpXjBAKkrIUg08y0TMc0aLhOa5KhPISi4U6rxIlALFUx1NycXY1s_327lertuNbfxEySCmjHPBvSkeTdq2zlksZWdNrexOUpADJTkgkAMCKZj8pSSXPvY2xix2qPcZ9GfdWnRyKyPFhb92vqjw0UgZX4N2g4pMRsDkqq99s8u_RZXTqiqt8iTdvimPEs4T6m33ow09s61BK502HjoWxqLuZdGa_5f-AYAolVM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204125595</pqid></control><display><type>article</type><title>Single-machine sequencing with controllable processing times</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Panwalkar, S.S. ; Rajagopalan, R.</creator><creatorcontrib>Panwalkar, S.S. ; Rajagopalan, R.</creatorcontrib><description>We consider a static single-machine sequencing problem which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness cost, and total processing cost.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/0377-2217(92)90144-X</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Costs ; due date assignment ; Exact sciences and technology ; Job shops ; Mathematical models ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Processing ; Scheduling ; Scheduling, sequencing ; Sequential scheduling ; Timing</subject><ispartof>European journal of operational research, 1992-06, Vol.59 (2), p.298-302</ispartof><rights>1992</rights><rights>1992 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Jun 10, 1992</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c427t-bdfed57f9acd08c5d20e19f087c0588945b21d61bbaf608f59aecbd6aa0a57c3</citedby><cites>FETCH-LOGICAL-c427t-bdfed57f9acd08c5d20e19f087c0588945b21d61bbaf608f59aecbd6aa0a57c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/037722179290144X$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,3994,27903,27904,65309</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5365561$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a59_3ay_3a1992_3ai_3a2_3ap_3a298-302.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Panwalkar, S.S.</creatorcontrib><creatorcontrib>Rajagopalan, R.</creatorcontrib><title>Single-machine sequencing with controllable processing times</title><title>European journal of operational research</title><description>We consider a static single-machine sequencing problem which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness cost, and total processing cost.</description><subject>Applied sciences</subject><subject>Costs</subject><subject>due date assignment</subject><subject>Exact sciences and technology</subject><subject>Job shops</subject><subject>Mathematical models</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Processing</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><subject>Sequential scheduling</subject><subject>Timing</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9kE1LxDAQhoMouK7-Aw9FPOihOkmbtgERZPGTBQ_uYW8hTaduln6ZdFf235ta2aOByQvJ-84MDyHnFG4o0OQWojQNGaPplWDXAmgch8sDMqFZysIkS-CQTPaWY3Li3BoAKKd8Qu4-TPNZYVgrvTINBg6_Ntho_xh8m34V6LbpbVtVKq8w6Gyr0bnhszc1ulNyVKrK4dmfTsni6XExewnn78-vs4d5qGOW9mFelFjwtBRKF5BpXjBAKkrIUg08y0TMc0aLhOa5KhPISi4U6rxIlALFUx1NycXY1s_327lertuNbfxEySCmjHPBvSkeTdq2zlksZWdNrexOUpADJTkgkAMCKZj8pSSXPvY2xix2qPcZ9GfdWnRyKyPFhb92vqjw0UgZX4N2g4pMRsDkqq99s8u_RZXTqiqt8iTdvimPEs4T6m33ow09s61BK502HjoWxqLuZdGa_5f-AYAolVM</recordid><startdate>19920610</startdate><enddate>19920610</enddate><creator>Panwalkar, S.S.</creator><creator>Rajagopalan, R.</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>19920610</creationdate><title>Single-machine sequencing with controllable processing times</title><author>Panwalkar, S.S. ; Rajagopalan, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c427t-bdfed57f9acd08c5d20e19f087c0588945b21d61bbaf608f59aecbd6aa0a57c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Applied sciences</topic><topic>Costs</topic><topic>due date assignment</topic><topic>Exact sciences and technology</topic><topic>Job shops</topic><topic>Mathematical models</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Processing</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><topic>Sequential scheduling</topic><topic>Timing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Panwalkar, S.S.</creatorcontrib><creatorcontrib>Rajagopalan, R.</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & 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>Panwalkar, S.S.</au><au>Rajagopalan, R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Single-machine sequencing with controllable processing times</atitle><jtitle>European journal of operational research</jtitle><date>1992-06-10</date><risdate>1992</risdate><volume>59</volume><issue>2</issue><spage>298</spage><epage>302</epage><pages>298-302</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>We consider a static single-machine sequencing problem which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness cost, and total processing cost.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0377-2217(92)90144-X</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 1992-06, Vol.59 (2), p.298-302 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204125595 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Applied sciences Costs due date assignment Exact sciences and technology Job shops Mathematical models Operational research and scientific management Operational research. Management science Operations research Processing Scheduling Scheduling, sequencing Sequential scheduling Timing |
| title | Single-machine sequencing with controllable processing times |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T13%3A28%3A46IST&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=Single-machine%20sequencing%20with%20controllable%20processing%20times&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Panwalkar,%20S.S.&rft.date=1992-06-10&rft.volume=59&rft.issue=2&rft.spage=298&rft.epage=302&rft.pages=298-302&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/0377-2217(92)90144-X&rft_dat=%3Cproquest_cross%3E1070507%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204125595&rft_id=info:pmid/&rft_els_id=037722179290144X&rfr_iscdi=true |