No-wait resource allocation flowshop scheduling with learning effect under limited cost availability
Abstract This article considers the no-wait flowshop scheduling with learning effect and resource allocation on two-machine. Our goal is to find the optimal resource allocations and job sequence that minimize the scheduling criterion (the total weighted resource consumption) subject to the constrain...
Saved in:
| Published in | Computer journal Vol. 62; no. 1; pp. 90 - 96 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Oxford University Press
01.01.2019
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | Abstract
This article considers the no-wait flowshop scheduling with learning effect and resource allocation on two-machine. Our goal is to find the optimal resource allocations and job sequence that minimize the scheduling criterion (the total weighted resource consumption) subject to the constraint that the total weighted resource consumption (the scheduling criterion) is less than or equal to a given constant, where the schedule criteria include weighted makespan, total completion (waiting) time and total absolute differences in completion (waiting) times. We show that these two problems are polynomially solvable respectively. |
|---|---|
| AbstractList | Abstract
This article considers the no-wait flowshop scheduling with learning effect and resource allocation on two-machine. Our goal is to find the optimal resource allocations and job sequence that minimize the scheduling criterion (the total weighted resource consumption) subject to the constraint that the total weighted resource consumption (the scheduling criterion) is less than or equal to a given constant, where the schedule criteria include weighted makespan, total completion (waiting) time and total absolute differences in completion (waiting) times. We show that these two problems are polynomially solvable respectively. |
| Author | Wang, Ji-Bo Wang, Xiao-Yuan Tian, Yu Xu, Ming Jiang, Chong |
| Author_xml | – sequence: 1 givenname: Yu surname: Tian fullname: Tian, Yu organization: School of Management and Journalism and Communications, Shenyang Sport University, Shenyang, China – sequence: 2 givenname: Ming surname: Xu fullname: Xu, Ming organization: Department of Civil Engineering, Tsinghia University, Beijing, China – sequence: 3 givenname: Chong surname: Jiang fullname: Jiang, Chong organization: School of Management and Journalism and Communications, Shenyang Sport University, Shenyang, China – sequence: 4 givenname: Ji-Bo surname: Wang fullname: Wang, Ji-Bo email: wangjibo75@163.com organization: School of Science, Shenyang Aerospace University, Shenyang, China – sequence: 5 givenname: Xiao-Yuan surname: Wang fullname: Wang, Xiao-Yuan email: wangjibo75@163.com organization: School of Science, Shenyang Aerospace University, Shenyang, China |
| BookMark | eNqFkD1PwzAQhi1UJNrCyO6RJfQch3yMqOJLqmCBOXIuZ-rKjSvboeTf0xImJMR0Oul5X909MzbpXEeMXQq4FlDJBbrtprOL5nMAmZ2wqchySFLIiwmbAghIsjyFMzYLYQMAKVT5lLXPLtkrE7mn4HqPxJW1DlU0ruPaun1Yux0PuKa2t6Z753sT19yS8t1xI60JI--7ljy3ZmsitRxdiFx9KGNVY6yJwzk71coGuviZc_Z2f_e6fExWLw9Py9tVgmkBMRFlUwpCVDIVpcoLlWUNlFXV3uSFyFtSOgMqtJKZKFJMZSkQJclGyxKhaEjOmRx70bsQPOkaTfx-JfrDNbWA-iiqHkXVo6hDKvmV2nmzVX74k78aedfv_kG_ADMHgPo |
| CitedBy_id | crossref_primary_10_1080_0305215X_2018_1521397 crossref_primary_10_1080_0305215X_2019_1604698 crossref_primary_10_1142_S0217595920500141 crossref_primary_10_1093_comjnl_bxae095 crossref_primary_10_3934_mbe_2021130 crossref_primary_10_3934_jimo_2020096 |
| Cites_doi | 10.1016/j.asoc.2015.01.028 10.1016/S0167-5060(08)70356-X 10.1007/s11590-012-0467-7 10.1007/s11590-012-0494-4 10.1093/comjnl/bxx007 10.1016/j.cie.2014.06.017 10.1016/j.cie.2010.06.002 10.1080/00207543.2015.1056323 10.1080/00207543.2014.954057 10.1142/S0217595914500365 10.1016/j.omega.2004.10.006 10.1016/j.ijpe.2013.12.021 10.1007/s10479-012-1111-8 10.1080/00207543.2015.1010746 10.1016/j.cie.2010.10.012 10.1016/j.cie.2015.05.032 10.1016/j.dam.2007.02.003 10.1016/j.cor.2013.07.001 10.1016/j.ejor.2007.05.040 10.1016/j.cor.2013.08.007 10.3934/jimo.2016060 10.1016/0895-7177(94)90206-2 |
| ContentType | Journal Article |
| Copyright | The British Computer Society 2018. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com 2018 |
| Copyright_xml | – notice: The British Computer Society 2018. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com 2018 |
| DBID | AAYXX CITATION |
| DOI | 10.1093/comjnl/bxy034 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1460-2067 |
| EndPage | 96 |
| ExternalDocumentID | 10_1093_comjnl_bxy034 10.1093/comjnl/bxy034 |
| GroupedDBID | -E4 -~X .2P .DC .I3 0R~ 123 18M 1TH 29F 3R3 4.4 48X 5VS 5WA 6J9 70D 85S AAIJN AAJKP AAMVS AAOGV AAPQZ AAPXW AARHZ AASNB AAUAY AAUQX AAVAP ABDTM ABEUO ABIXL ABNKS ABPTD ABQLI ABXVV ABZBJ ACBEA ACGFS ACGOD ACIWK ACNCT ACUFI ACUTJ ACYTK ADEYI ADEZT ADGZP ADHKW ADHZD ADIPN ADOCK ADQBN ADRDM ADRIX ADRTK ADVEK ADYVW ADZXQ AECKG AEGPL AEGXH AEJOX AEKKA AEKSI AEMDU AENEX AENZO AEPUE AETBJ AEWNT AFFZL AFIYH AFOFC AFXEN AGINJ AGKEF AGSYK AHXPO AIDUJ AIJHB AJEEA AJEUX ALMA_UNASSIGNED_HOLDINGS ALTZX ALUQC APIBT APWMN ATGXG AXUDD AZVOD BAYMD BCRHZ BEFXN BEYMZ BFFAM BGNUA BHONS BKEBE BPEOZ BQUQU BTQHN CDBKE CS3 CZ4 DAKXR DILTD DU5 D~K EBS EE~ F9B FLIZI FLUFQ FOEOM GAUVT GJXCC H13 H5~ HAR HW0 HZ~ IOX J21 JAVBF KBUDW KOP KSI KSN M-Z M49 ML0 N9A NGC NMDNZ NOMLY NU- O9- OCL ODMLO OJQWA OJZSN OWPYF P2P PAFKI PEELM PQQKQ Q1. Q5Y RD5 ROL ROX ROZ RUSNO RW1 RXO SC5 TAE TJP TN5 UCJ WH7 X7H XSW YAYTL YKOAZ YXANX ZKX ~91 AAYXX ABAZT ABDFA ABEJV ABGNP ABVGC ABVLG ACUXJ ADMLS ADYJX AGORE AHGBF AJBYB AJNCP ALXQX ANAKG CITATION JXSIZ |
| ID | FETCH-LOGICAL-c270t-18b81ecca3218a67a44b0899d56716deaf40e7fa34172c2381cc3e3bf38c07be3 |
| ISSN | 0010-4620 |
| IngestDate | Thu Apr 24 23:05:20 EDT 2025 Tue Jul 01 02:55:05 EDT 2025 Wed Sep 11 04:47:08 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | scheduling no-wait flowshop controllable job processing times learning effect |
| Language | English |
| License | This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://academic.oup.com/journals/pages/open_access/funder_policies/chorus/standard_publication_model) https://academic.oup.com/journals/pages/open_access/funder_policies/chorus/standard_publication_model |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c270t-18b81ecca3218a67a44b0899d56716deaf40e7fa34172c2381cc3e3bf38c07be3 |
| PageCount | 7 |
| ParticipantIDs | crossref_citationtrail_10_1093_comjnl_bxy034 crossref_primary_10_1093_comjnl_bxy034 oup_primary_10_1093_comjnl_bxy034 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20190101 2019-01-01 |
| PublicationDateYYYYMMDD | 2019-01-01 |
| PublicationDate_xml | – month: 01 year: 2019 text: 20190101 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Computer journal |
| PublicationYear | 2019 |
| Publisher | Oxford University Press |
| Publisher_xml | – name: Oxford University Press |
| References | Lu ( key 2019011011280000200_bxy034C18) 2014; 8 Wang ( key 2019011011280000200_bxy034C19) 2015; 53 Graham ( key 2019011011280000200_bxy034C26) 1979; 5 Hardy ( key 2019011011280000200_bxy034C27) 1967 Wu ( key 2019011011280000200_bxy034C8) 2017 Wang ( key 2019011011280000200_bxy034C4) 2014; 8 Yang ( key 2019011011280000200_bxy034C10) 2014; 150 Zhu ( key 2019011011280000200_bxy034C16) 2011; 60 Mor ( key 2019011011280000200_bxy034C9) 2014; 41 Wang ( key 2019011011280000200_bxy034C5) 2013; 40 Wang ( key 2019011011280000200_bxy034C17) 2017; 13 Wang ( key 2019011011280000200_bxy034C24) 2006; 34 Hsieh ( key 2019011011280000200_bxy034C12) 2015; 30 Wang ( key 2019011011280000200_bxy034C20) 2017 Shiau ( key 2019011011280000200_bxy034C6) 2015; 87 Wang ( key 2019011011280000200_bxy034C21) 2014; 31 Biskup ( key 2019011011280000200_bxy034C1) 2008; 188 Shabtay ( key 2019011011280000200_bxy034C2) 2007; 155 Janiak ( key 2019011011280000200_bxy034C25) 1994; 20 Wang ( key 2019011011280000200_bxy034C15) 2010; 59 Kuo ( key 2019011011280000200_bxy034C3) 2012; 196 Zhao ( key 2019011011280000200_bxy034C13) 2017; 60 Li ( key 2019011011280000200_bxy034C22) 2015; 53 Liu ( key 2019011011280000200_bxy034C23) 2014; 75 Wang ( key 2019011011280000200_bxy034C7) 2016 Liu ( key 2019011011280000200_bxy034C11) 2016; 54 Wang ( key 2019011011280000200_bxy034C14) 2017 |
| References_xml | – volume: 30 start-page: 475 year: 2015 ident: key 2019011011280000200_bxy034C12 article-title: Decision support for unrelated parallel machine scheduling with discrete controllable processing times publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.01.028 – volume: 5 start-page: 287 year: 1979 ident: key 2019011011280000200_bxy034C26 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discrete Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 8 start-page: 113 year: 2014 ident: key 2019011011280000200_bxy034C18 article-title: Optimal due-date assignment problem with learning effect and resource-dependent processing times publication-title: Optim. Lett. doi: 10.1007/s11590-012-0467-7 – volume: 8 start-page: 971 year: 2014 ident: key 2019011011280000200_bxy034C4 article-title: Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects publication-title: Optim. Lett. doi: 10.1007/s11590-012-0494-4 – volume: 60 start-page: 1353 year: 2017 ident: key 2019011011280000200_bxy034C13 article-title: An investigation of single-machine due-window assignment with time-dependent processing times and a controllable rate-modifying activity publication-title: Comput. J. doi: 10.1093/comjnl/bxx007 – volume: 75 start-page: 170 year: 2014 ident: key 2019011011280000200_bxy034C23 article-title: Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2014.06.017 – volume: 59 start-page: 458 year: 2010 ident: key 2019011011280000200_bxy034C15 article-title: Single-machine scheduling with learning effect and resource-dependent processing times publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2010.06.002 – volume: 54 start-page: 1186 year: 2016 ident: key 2019011011280000200_bxy034C11 article-title: Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2015.1056323 – volume: 53 start-page: 1228 year: 2015 ident: key 2019011011280000200_bxy034C22 article-title: Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2014.954057 – volume: 31 start-page: 1450036 year: 2014 ident: key 2019011011280000200_bxy034C21 article-title: Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times publication-title: Asia Pac. J. Oper. Res. doi: 10.1142/S0217595914500365 – volume: 34 start-page: 327 year: 2006 ident: key 2019011011280000200_bxy034C24 article-title: Flowshop scheduling with deteriorating jobs under dominating machines publication-title: Omega doi: 10.1016/j.omega.2004.10.006 – volume-title: Inequalities year: 1967 ident: key 2019011011280000200_bxy034C27 – year: 2017 ident: key 2019011011280000200_bxy034C20 article-title: Single machine CON/SLK due date assignment scheduling with controllable processing time and job-dependent learning effects publication-title: Comput. J. – year: 2017 ident: key 2019011011280000200_bxy034C8 article-title: A multi-machine order scheduling with learning using the genetic algorithm and particle swarm optimization publication-title: Comput. J. – volume: 150 start-page: 96 year: 2014 ident: key 2019011011280000200_bxy034C10 article-title: Scheduling problems with multiple due windows assignment and controllable processing times on a single machine publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2013.12.021 – year: 2016 ident: key 2019011011280000200_bxy034C7 article-title: Research on m-machine flow shop scheduling with truncated learning effects publication-title: Int. Trans. Oper. Res. – volume: 196 start-page: 349 year: 2012 ident: key 2019011011280000200_bxy034C3 article-title: Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect publication-title: Ann. Oper. Res. doi: 10.1007/s10479-012-1111-8 – volume: 53 start-page: 5826 year: 2015 ident: key 2019011011280000200_bxy034C19 article-title: Research on scheduling with job-dependent learning effect and convex resource dependent processing times publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2015.1010746 – volume: 60 start-page: 148 year: 2011 ident: key 2019011011280000200_bxy034C16 article-title: Single-machine group scheduling with resource allocation and learning effect publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2010.10.012 – volume: 87 start-page: 580 year: 2015 ident: key 2019011011280000200_bxy034C6 article-title: Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2015.05.032 – year: 2017 ident: key 2019011011280000200_bxy034C14 article-title: Single machine total absolute differences penalties minimization scheduling with a deteriorating and resource-dependent maintenance activity publication-title: Comput. J. – volume: 155 start-page: 1643 year: 2007 ident: key 2019011011280000200_bxy034C2 article-title: A survey of scheduling with controllable processing times publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2007.02.003 – volume: 40 start-page: 2906 year: 2013 ident: key 2019011011280000200_bxy034C5 article-title: Several flow shop scheduling problems with truncated position-based learning effect publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.07.001 – volume: 188 start-page: 315 year: 2008 ident: key 2019011011280000200_bxy034C1 article-title: A state-of-the-art review on scheduling with learning effects publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.05.040 – volume: 41 start-page: 115 year: 2014 ident: key 2019011011280000200_bxy034C9 article-title: Batch scheduling of identical jobs with controllable processing times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.08.007 – volume: 13 start-page: 1025 year: 2017 ident: key 2019011011280000200_bxy034C17 article-title: Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects publication-title: J. Ind. Manage. Optim. doi: 10.3934/jimo.2016060 – volume: 20 start-page: 53 year: 1994 ident: key 2019011011280000200_bxy034C25 article-title: Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption publication-title: Math. Comput. Model. doi: 10.1016/0895-7177(94)90206-2 |
| SSID | ssj0002096 |
| Score | 2.2199807 |
| Snippet | Abstract
This article considers the no-wait flowshop scheduling with learning effect and resource allocation on two-machine. Our goal is to find the optimal... |
| SourceID | crossref oup |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 90 |
| Title | No-wait resource allocation flowshop scheduling with learning effect under limited cost availability |
| Volume | 62 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT-MwELZKuXBhH4CAfcgrIS7BkNrBSY4sDyEEXABRTpXjOqIoalBJl9297h_fccZJU0ERcLEia2Qlni_jmfE8CNmQKdehAksV-OuzQArDorSvma1FLsIk5EbZBOezc3l8FZx0d7ut1r9G1NK4SLb132fzSt7DVZgDvtos2Tdwtl4UJuAZ-AsjcBjGV_H4PGePalB4I-eD9-wtunbhg1n--HCb33tgvsJxktVO16xyhmAoR9kId-RlmOjk6fyh8NQvNciwgPfUrW_VAsJrvl0Zw4tu1JtxNdMdY0y-OxdtiM7Aeab3b_PJ7LWbPBmwn3nTA2GTnqY8EDMyG5tSt4QBx_sXg4I2kD6zpeObkljyJ4hDsRr7jQMaO-A-Ef1YFguYeTfM4CH5_cd3btLpetozaefIPAdbg7fJ_N7B2elFfaBzv2zzVn-GK9UKi-zgEju4wJRqY9MlG5rK5Uey6EwMuod4-URaZviZfKh4R500XyJ9Bx9awYdO4EMr-NAJfKiFD63gQxE-tIQPdfChFj60CZ9lcnV0eLl_zFzTDaZ56BesEyVRx_7XApQ_JUMVBIm9Gu7vSjCt-_DrBr4JUwXaT8i1Vfi0FkYkqYi0HyZGrJD2MB-aVUJB2IP5HetIxnHAgzQWQksjRQeGWKpojWxV-9XTriK9bYyS9TAyQvRwe3u4vWtksya_x1Isswh_wOa_TLP-CpovZGEC96-kXYzG5huooEXy3UHkP0N4kC4 |
| linkProvider | EBSCOhost |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=No-wait+resource+allocation+flowshop+scheduling+with+learning+effect+under+limited+cost+availability&rft.jtitle=Computer+journal&rft.au=Tian%2C+Yu&rft.au=Xu%2C+Ming&rft.au=Jiang%2C+Chong&rft.au=Wang%2C+Ji-Bo&rft.date=2019-01-01&rft.pub=Oxford+University+Press&rft.issn=0010-4620&rft.eissn=1460-2067&rft.volume=62&rft.issue=1&rft.spage=90&rft.epage=96&rft_id=info:doi/10.1093%2Fcomjnl%2Fbxy034&rft.externalDocID=10.1093%2Fcomjnl%2Fbxy034 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0010-4620&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0010-4620&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0010-4620&client=summon |