Multiobjective single machine scheduling with nontraditional requirements
Many scheduling problems encountered in practice are must address requirements that are not found in the literature like maximizing the number of jobs that have a particular color. These nontraditional requirements are sometimes an objective as when the desirability of a schedule increases with the...
Gespeichert in:
| Veröffentlicht in: | International journal of production economics 2007-04, Vol.106 (2), p.574-584 |
|---|---|
| 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 | 584 |
|---|---|
| container_issue | 2 |
| container_start_page | 574 |
| container_title | International journal of production economics |
| container_volume | 106 |
| creator | Haral, Uday Chen, Rew-Win Ferrell, William G. Kurz, Mary Beth |
| description | Many scheduling problems encountered in practice are must address requirements that are not found in the literature like maximizing the number of jobs that have a particular color. These nontraditional requirements are sometimes an objective as when the desirability of a schedule increases with the number of jobs of the same color that are scheduled consecutively. Other times, the requirements take the form of constraints as in cases where it is forbidden to have more than two consecutive jobs with a particular color. To complicate the situation, most real scheduling problems are multiobjective. This research centers on bicriteria scheduling with nontraditional requirements using an experimental approach and a Random Keys Genetic Algorithm to find Pareto optimal solutions. We address both traditional and nontraditional requirements in a single machine job shop with 20–50 jobs. |
| doi_str_mv | 10.1016/j.ijpe.2006.06.018 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_198963361</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S092552730600212X</els_id><sourcerecordid>1209193041</sourcerecordid><originalsourceid>FETCH-LOGICAL-c426t-d0327c144f0fee29a704ff7a720abd424e5457a5bed8f470a89c0de097d17203</originalsourceid><addsrcrecordid>eNp9UE1LxDAQDaLg-vEHPBXvXZM0bVLwIuIXKl72HrLJ1E3ptt0kXfHfO2XFozCPyQzvvQyPkCtGl4yy6qZd-naEJae0Ws7F1BFZMCWLXJayPiYLWvMyL7ksTslZjC2lVDKlFuTlfeqSH9Yt2OT3kEXff3aQbY3d-B5HuwE3dbjMvnzaZP3Qp2CcR0lvuizAbvIBttCneEFOGtNFuPzt52T1-LC6f87fPp5e7u_ecit4lXJHCy4tE6KhDQCvjaSiaaSRnJq1E1xAKUppyjU41QhJjaotdUBr6RhyinNyfbAdw7CbICbdDlPAY6JmtaqroqgYkviBZMMQY4BGj8FvTfjWjOo5MN3qOTA9B6bnYgpFrwdRgBHsnwIA8Cuwg97rwjAkF-YbgVKJzc9PxIgopdClEnqTtuh2e3ADzGLvIehoPfQWHAZmk3aD_--YH8BrjuI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>198963361</pqid></control><display><type>article</type><title>Multiobjective single machine scheduling with nontraditional requirements</title><source>RePEc</source><source>Elsevier ScienceDirect Journals Complete</source><creator>Haral, Uday ; Chen, Rew-Win ; Ferrell, William G. ; Kurz, Mary Beth</creator><creatorcontrib>Haral, Uday ; Chen, Rew-Win ; Ferrell, William G. ; Kurz, Mary Beth</creatorcontrib><description>Many scheduling problems encountered in practice are must address requirements that are not found in the literature like maximizing the number of jobs that have a particular color. These nontraditional requirements are sometimes an objective as when the desirability of a schedule increases with the number of jobs of the same color that are scheduled consecutively. Other times, the requirements take the form of constraints as in cases where it is forbidden to have more than two consecutive jobs with a particular color. To complicate the situation, most real scheduling problems are multiobjective. This research centers on bicriteria scheduling with nontraditional requirements using an experimental approach and a Random Keys Genetic Algorithm to find Pareto optimal solutions. We address both traditional and nontraditional requirements in a single machine job shop with 20–50 jobs.</description><identifier>ISSN: 0925-5273</identifier><identifier>EISSN: 1873-7579</identifier><identifier>DOI: 10.1016/j.ijpe.2006.06.018</identifier><identifier>CODEN: IJPCEY</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Genetic algorithms ; Job shops ; Multicriteria scheduling ; Nontraditional requirements ; Pareto optimum ; Requirements ; Scheduling ; Studies</subject><ispartof>International journal of production economics, 2007-04, Vol.106 (2), p.574-584</ispartof><rights>2006 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Apr 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c426t-d0327c144f0fee29a704ff7a720abd424e5457a5bed8f470a89c0de097d17203</citedby><cites>FETCH-LOGICAL-c426t-d0327c144f0fee29a704ff7a720abd424e5457a5bed8f470a89c0de097d17203</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ijpe.2006.06.018$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,4008,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeproeco/v_3a106_3ay_3a2007_3ai_3a2_3ap_3a574-584.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Haral, Uday</creatorcontrib><creatorcontrib>Chen, Rew-Win</creatorcontrib><creatorcontrib>Ferrell, William G.</creatorcontrib><creatorcontrib>Kurz, Mary Beth</creatorcontrib><title>Multiobjective single machine scheduling with nontraditional requirements</title><title>International journal of production economics</title><description>Many scheduling problems encountered in practice are must address requirements that are not found in the literature like maximizing the number of jobs that have a particular color. These nontraditional requirements are sometimes an objective as when the desirability of a schedule increases with the number of jobs of the same color that are scheduled consecutively. Other times, the requirements take the form of constraints as in cases where it is forbidden to have more than two consecutive jobs with a particular color. To complicate the situation, most real scheduling problems are multiobjective. This research centers on bicriteria scheduling with nontraditional requirements using an experimental approach and a Random Keys Genetic Algorithm to find Pareto optimal solutions. We address both traditional and nontraditional requirements in a single machine job shop with 20–50 jobs.</description><subject>Genetic algorithms</subject><subject>Job shops</subject><subject>Multicriteria scheduling</subject><subject>Nontraditional requirements</subject><subject>Pareto optimum</subject><subject>Requirements</subject><subject>Scheduling</subject><subject>Studies</subject><issn>0925-5273</issn><issn>1873-7579</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9UE1LxDAQDaLg-vEHPBXvXZM0bVLwIuIXKl72HrLJ1E3ptt0kXfHfO2XFozCPyQzvvQyPkCtGl4yy6qZd-naEJae0Ws7F1BFZMCWLXJayPiYLWvMyL7ksTslZjC2lVDKlFuTlfeqSH9Yt2OT3kEXff3aQbY3d-B5HuwE3dbjMvnzaZP3Qp2CcR0lvuizAbvIBttCneEFOGtNFuPzt52T1-LC6f87fPp5e7u_ecit4lXJHCy4tE6KhDQCvjaSiaaSRnJq1E1xAKUppyjU41QhJjaotdUBr6RhyinNyfbAdw7CbICbdDlPAY6JmtaqroqgYkviBZMMQY4BGj8FvTfjWjOo5MN3qOTA9B6bnYgpFrwdRgBHsnwIA8Cuwg97rwjAkF-YbgVKJzc9PxIgopdClEnqTtuh2e3ADzGLvIehoPfQWHAZmk3aD_--YH8BrjuI</recordid><startdate>20070401</startdate><enddate>20070401</enddate><creator>Haral, Uday</creator><creator>Chen, Rew-Win</creator><creator>Ferrell, William G.</creator><creator>Kurz, Mary Beth</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>7TA</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JG9</scope><scope>KR7</scope></search><sort><creationdate>20070401</creationdate><title>Multiobjective single machine scheduling with nontraditional requirements</title><author>Haral, Uday ; Chen, Rew-Win ; Ferrell, William G. ; Kurz, Mary Beth</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c426t-d0327c144f0fee29a704ff7a720abd424e5457a5bed8f470a89c0de097d17203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Genetic algorithms</topic><topic>Job shops</topic><topic>Multicriteria scheduling</topic><topic>Nontraditional requirements</topic><topic>Pareto optimum</topic><topic>Requirements</topic><topic>Scheduling</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Haral, Uday</creatorcontrib><creatorcontrib>Chen, Rew-Win</creatorcontrib><creatorcontrib>Ferrell, William G.</creatorcontrib><creatorcontrib>Kurz, Mary Beth</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Materials Research Database</collection><collection>Civil Engineering Abstracts</collection><jtitle>International journal of production economics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Haral, Uday</au><au>Chen, Rew-Win</au><au>Ferrell, William G.</au><au>Kurz, Mary Beth</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multiobjective single machine scheduling with nontraditional requirements</atitle><jtitle>International journal of production economics</jtitle><date>2007-04-01</date><risdate>2007</risdate><volume>106</volume><issue>2</issue><spage>574</spage><epage>584</epage><pages>574-584</pages><issn>0925-5273</issn><eissn>1873-7579</eissn><coden>IJPCEY</coden><abstract>Many scheduling problems encountered in practice are must address requirements that are not found in the literature like maximizing the number of jobs that have a particular color. These nontraditional requirements are sometimes an objective as when the desirability of a schedule increases with the number of jobs of the same color that are scheduled consecutively. Other times, the requirements take the form of constraints as in cases where it is forbidden to have more than two consecutive jobs with a particular color. To complicate the situation, most real scheduling problems are multiobjective. This research centers on bicriteria scheduling with nontraditional requirements using an experimental approach and a Random Keys Genetic Algorithm to find Pareto optimal solutions. We address both traditional and nontraditional requirements in a single machine job shop with 20–50 jobs.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ijpe.2006.06.018</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0925-5273 |
| ispartof | International journal of production economics, 2007-04, Vol.106 (2), p.574-584 |
| issn | 0925-5273 1873-7579 |
| language | eng |
| recordid | cdi_proquest_journals_198963361 |
| source | RePEc; Elsevier ScienceDirect Journals Complete |
| subjects | Genetic algorithms Job shops Multicriteria scheduling Nontraditional requirements Pareto optimum Requirements Scheduling Studies |
| title | Multiobjective single machine scheduling with nontraditional requirements |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T00%3A13%3A32IST&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=Multiobjective%20single%20machine%20scheduling%20with%20nontraditional%20requirements&rft.jtitle=International%20journal%20of%20production%20economics&rft.au=Haral,%20Uday&rft.date=2007-04-01&rft.volume=106&rft.issue=2&rft.spage=574&rft.epage=584&rft.pages=574-584&rft.issn=0925-5273&rft.eissn=1873-7579&rft.coden=IJPCEY&rft_id=info:doi/10.1016/j.ijpe.2006.06.018&rft_dat=%3Cproquest_cross%3E1209193041%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=198963361&rft_id=info:pmid/&rft_els_id=S092552730600212X&rfr_iscdi=true |