Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
This paper deals with the problem of the scheduling of jobs on a single machine presented in terms of decision-aid. This leads to determining the characteristics of the set of schedules which are compatible with the earliest starting times and the latest finishing times of the jobs. A theorem, which...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 1980-01, Vol.4 (3), p.189-194 |
|---|---|
| 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 | 194 |
|---|---|
| container_issue | 3 |
| container_start_page | 189 |
| container_title | European journal of operational research |
| container_volume | 4 |
| creator | Erschler, J. Roubellat, F. Vernhes, J.P. |
| description | This paper deals with the problem of the scheduling of jobs on a single machine presented in terms of decision-aid. This leads to determining the characteristics of the set of schedules which are compatible with the earliest starting times and the latest finishing times of the jobs.
A theorem, which enables the determination of the necessary and sufficient conditions for the feasibility of jobs sequences, is proposed. From this basis, an iterative procedure is presented which permits to define the characteristics of the feasible schedules. A Boolean model is used to represent and handle the conditions of feasibility of the schedules. |
| doi_str_mv | 10.1016/0377-2217(80)90005-3 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204105094</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0377221780900053</els_id><sourcerecordid>1069824</sourcerecordid><originalsourceid>FETCH-LOGICAL-c397t-a044cc5fa5dfc8731c7d3052188770d4ffca1bd15abb5bc3b0c5cb861fd0a0613</originalsourceid><addsrcrecordid>eNp9kEFr3DAQhUVoIduk_6AH0VNycDtjWZZ8CYSlSQOBXpJjEJI86mrJWlvJG0h_feVuybGCh5B4783wMfYJ4QsC9l9BKNW0LaoLDZcDAMhGnLAVatU2ve7hHVu9WU7Zh1K21YMS5Yo9rTc2Wz9Tjr_j9JPPG-KFZp4CD2RLdM_L-9eBJk-Fh5T5xLfJFT4n7oh7m3OkkadDjUzc8lJLamRn_SZOdM7eB_tc6OO_-4w93nx7WH9v7n_c3q2v7xsvBjU3FrrOexmsHIPXSqBXowDZotZKwdiF4C26EaV1TjovHHjpne4xjGChR3HGPh979znVXctstumQpzrStNAhSBi6auqOJp9TKZmC2ee4s_nVIJiFo1kgmQWS0WD-cjSixu6OsUx78m8ZqmebMhXzYoTtql6rcKhJYWOVqNovX3owOHRmM-9q19WxiyqMl0jZFB8XtGPM5Gczpvj_Zf4ABCeSrQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204105094</pqid></control><display><type>article</type><title>Characterizing the set of feasible sequences for n jobs to be carried out on a single machine</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Erschler, J. ; Roubellat, F. ; Vernhes, J.P.</creator><creatorcontrib>Erschler, J. ; Roubellat, F. ; Vernhes, J.P.</creatorcontrib><description>This paper deals with the problem of the scheduling of jobs on a single machine presented in terms of decision-aid. This leads to determining the characteristics of the set of schedules which are compatible with the earliest starting times and the latest finishing times of the jobs.
A theorem, which enables the determination of the necessary and sufficient conditions for the feasibility of jobs sequences, is proposed. From this basis, an iterative procedure is presented which permits to define the characteristics of the feasible schedules. A Boolean model is used to represent and handle the conditions of feasibility of the schedules.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/0377-2217(80)90005-3</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Job shops ; Machines ; Operations research ; Optimization ; Production planning ; Production scheduling ; Scheduling</subject><ispartof>European journal of operational research, 1980-01, Vol.4 (3), p.189-194</ispartof><rights>1980</rights><rights>Copyright Elsevier Sequoia S.A. Mar 1980</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c397t-a044cc5fa5dfc8731c7d3052188770d4ffca1bd15abb5bc3b0c5cb861fd0a0613</citedby><cites>FETCH-LOGICAL-c397t-a044cc5fa5dfc8731c7d3052188770d4ffca1bd15abb5bc3b0c5cb861fd0a0613</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/0377-2217(80)90005-3$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,778,782,3539,3996,27907,27908,45978</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a4_3ay_3a1980_3ai_3a3_3ap_3a189-194.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Erschler, J.</creatorcontrib><creatorcontrib>Roubellat, F.</creatorcontrib><creatorcontrib>Vernhes, J.P.</creatorcontrib><title>Characterizing the set of feasible sequences for n jobs to be carried out on a single machine</title><title>European journal of operational research</title><description>This paper deals with the problem of the scheduling of jobs on a single machine presented in terms of decision-aid. This leads to determining the characteristics of the set of schedules which are compatible with the earliest starting times and the latest finishing times of the jobs.
A theorem, which enables the determination of the necessary and sufficient conditions for the feasibility of jobs sequences, is proposed. From this basis, an iterative procedure is presented which permits to define the characteristics of the feasible schedules. A Boolean model is used to represent and handle the conditions of feasibility of the schedules.</description><subject>Job shops</subject><subject>Machines</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Production planning</subject><subject>Production scheduling</subject><subject>Scheduling</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1980</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9kEFr3DAQhUVoIduk_6AH0VNycDtjWZZ8CYSlSQOBXpJjEJI86mrJWlvJG0h_feVuybGCh5B4783wMfYJ4QsC9l9BKNW0LaoLDZcDAMhGnLAVatU2ve7hHVu9WU7Zh1K21YMS5Yo9rTc2Wz9Tjr_j9JPPG-KFZp4CD2RLdM_L-9eBJk-Fh5T5xLfJFT4n7oh7m3OkkadDjUzc8lJLamRn_SZOdM7eB_tc6OO_-4w93nx7WH9v7n_c3q2v7xsvBjU3FrrOexmsHIPXSqBXowDZotZKwdiF4C26EaV1TjovHHjpne4xjGChR3HGPh979znVXctstumQpzrStNAhSBi6auqOJp9TKZmC2ee4s_nVIJiFo1kgmQWS0WD-cjSixu6OsUx78m8ZqmebMhXzYoTtql6rcKhJYWOVqNovX3owOHRmM-9q19WxiyqMl0jZFB8XtGPM5Gczpvj_Zf4ABCeSrQ</recordid><startdate>19800101</startdate><enddate>19800101</enddate><creator>Erschler, J.</creator><creator>Roubellat, F.</creator><creator>Vernhes, J.P.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><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>19800101</creationdate><title>Characterizing the set of feasible sequences for n jobs to be carried out on a single machine</title><author>Erschler, J. ; Roubellat, F. ; Vernhes, J.P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c397t-a044cc5fa5dfc8731c7d3052188770d4ffca1bd15abb5bc3b0c5cb861fd0a0613</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1980</creationdate><topic>Job shops</topic><topic>Machines</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Production planning</topic><topic>Production scheduling</topic><topic>Scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Erschler, J.</creatorcontrib><creatorcontrib>Roubellat, F.</creatorcontrib><creatorcontrib>Vernhes, J.P.</creatorcontrib><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>Erschler, J.</au><au>Roubellat, F.</au><au>Vernhes, J.P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Characterizing the set of feasible sequences for n jobs to be carried out on a single machine</atitle><jtitle>European journal of operational research</jtitle><date>1980-01-01</date><risdate>1980</risdate><volume>4</volume><issue>3</issue><spage>189</spage><epage>194</epage><pages>189-194</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>This paper deals with the problem of the scheduling of jobs on a single machine presented in terms of decision-aid. This leads to determining the characteristics of the set of schedules which are compatible with the earliest starting times and the latest finishing times of the jobs.
A theorem, which enables the determination of the necessary and sufficient conditions for the feasibility of jobs sequences, is proposed. From this basis, an iterative procedure is presented which permits to define the characteristics of the feasible schedules. A Boolean model is used to represent and handle the conditions of feasibility of the schedules.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0377-2217(80)90005-3</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 1980-01, Vol.4 (3), p.189-194 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204105094 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Job shops Machines Operations research Optimization Production planning Production scheduling Scheduling |
| title | Characterizing the set of feasible sequences for n jobs to be carried out on a single machine |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T01%3A21%3A56IST&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=Characterizing%20the%20set%20of%20feasible%20sequences%20for%20n%20jobs%20to%20be%20carried%20out%20on%20a%20single%20machine&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Erschler,%20J.&rft.date=1980-01-01&rft.volume=4&rft.issue=3&rft.spage=189&rft.epage=194&rft.pages=189-194&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/0377-2217(80)90005-3&rft_dat=%3Cproquest_cross%3E1069824%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=204105094&rft_id=info:pmid/&rft_els_id=0377221780900053&rfr_iscdi=true |