Optimization models for the tool change scheduling problem
Traditional machine scheduling literature generally assumes that a machine is available at all times. Yet this assumption may not be accurate in real manufacturing systems. In many cases, a machine's tool must be changed after it has continuously worked for a period of time. This paper deals wi...
Gespeichert in:
| Veröffentlicht in: | Omega (Oxford) Jg. 36; H. 5; S. 888 - 894 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Exeter
Elsevier Ltd
01.10.2008
Elsevier Elsevier Science Publishers Pergamon Press Inc |
| Schriftenreihe: | Omega |
| Schlagworte: | |
| ISSN: | 0305-0483, 1873-5274 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Traditional machine scheduling literature generally assumes that a machine is available at all times. Yet this assumption may not be accurate in real manufacturing systems. In many cases, a machine's tool must be changed after it has continuously worked for a period of time. This paper deals with a single machine scheduling problem subject to tool wear, given the allowed maximum continuous working time of the machine is
T
L
(tool life) and the tool change time is
T
C
. Job processing and tool changes are scheduled simultaneously. In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem. Computational experiments are performed to evaluate the models’ efficiency. |
|---|---|
| AbstractList | Traditional machine scheduling literature generally assumes that a machine is available at all times. Yet this assumption may not be accurate in real manufacturing systems. In many cases, a machine's tool must be changed after it has continuously worked for a period of time. This paper deals with a single machine scheduling problem subject to tool wear, given the allowed maximum continuous working time of the machine is [T.sub.L] (tool life) and the tool change time is [T.sub.C]. Job processing and tool changes are scheduled simultaneously. In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem. Computational experiments are performed to evaluate the models' efficiency. Keywords: Scheduling; Tool change; Integer programming; Tardiness; Availability constraints Traditional machine scheduling literature generally assumes that a machine is available at all times. Yet this assumption may not be accurate in real manufacturing systems. In many cases, a machine's tool must be changed after it has continuously worked for a period of time. This paper deals with a single machine scheduling problem subject to tool wear, given the allowed maximum continuous working time of the machine is T^sub L^ (tool life) and the tool change time is T^sub C^. Job processing and tool changes are scheduled simultaneously. In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem. Computational experiments are performed to evaluate the models' efficiency. [PUBLICATION ABSTRACT] Traditional machine scheduling literature generally assumes that a machine is available at all times. Yet this assumption may not be accurate in real manufacturing systems. In many cases, a machine's tool must be changed after it has continuously worked for a period of time. This paper deals with a single machine scheduling problem subject to tool wear, given the allowed maximum continuous working time of the machine is TL (tool life) and the tool change time is TC. Job processing and tool changes are scheduled simultaneously. In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem. Computational experiments are performed to evaluate the models' efficiency. Traditional machine scheduling literature generally assumes that a machine is available at all times. Yet this assumption may not be accurate in real manufacturing systems. In many cases, a machine's tool must be changed after it has continuously worked for a period of time. This paper deals with a single machine scheduling problem subject to tool wear, given the allowed maximum continuous working time of the machine is T L (tool life) and the tool change time is T C . Job processing and tool changes are scheduled simultaneously. In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem. Computational experiments are performed to evaluate the models’ efficiency. Traditional machine scheduling literature generally assumes that a machine is available at all times. Yet this assumption may not be accurate in real manufacturing systems. In many cases, a machine's tool must be changed after it has continuously worked for a period of time. This paper deals with a single machine scheduling problem subject to tool wear, given the allowed maximum continuous working time of the machine is [T.sub.L] (tool life) and the tool change time is [T.sub.C]. Job processing and tool changes are scheduled simultaneously. In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem. Computational experiments are performed to evaluate the models' efficiency. |
| Audience | Trade Academic |
| Author | Chen, Jen-Shiang |
| Author_xml | – sequence: 1 givenname: Jen-Shiang surname: Chen fullname: Chen, Jen-Shiang email: jschen@cc.fec.edu.tw, jschenc@ms25.hinet.net organization: Department of Industrial and Business Management, Far East College, 49 Junghua Road, Shinshr Shiang, Tainan 744, Taiwan, ROC |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20072515$$DView record in Pascal Francis http://econpapers.repec.org/article/eeejomega/v_3a36_3ay_3a2008_3ai_3a5_3ap_3a888-894.htm$$DView record in RePEc |
| BookMark | eNqFUk1r3TAQFCWFvqT9Bb2YQo92JUuy5UIPIfSTQC7tWehJaz8ZW3Ilv0Dy67svDjmU0CJGA2Jml93ROTkLMQAhbxmtGGXNh7GKMwymqiltKioqpBdkx1TLS1m34ozsKKeypELxV-Q855FSyhTlO_LxZln97O_N6mMo5uhgykUfU7EeoFhjnAp7MGGAItsDuOPkw1AsKe4nmF-Tl72ZMrx55Avy68vnn1ffyuubr9-vLq9LK7lcy67ZN1Z0QjDXKyf2tTStYC2nNTfOOKWskAwMN50FWitnTSed49Aa01vhGL8g77a62Pf3EfKqx3hMAVvqmjeC1Q09icpNNJgJtA99XJOxAwRIZsJl9R6fL1nb1o1sO4r66hk9Hgezt88afmyGBAtYvSQ_m3SnAWB82L2-1dzwBq87BAahkDxCIhaEUkqrTujDOmOx948jmWzN1CcTrM9PRdHd1pJJ1PFNZ1PMOUH_JGFUn5LXo966n5LXVGgkdHV_uaxfHwLGGf30H--nzYv_AG49JJ2th2DB-QR21S76f_r_AHGJyus |
| CODEN | OMEGA6 |
| CitedBy_id | crossref_primary_10_1016_j_cie_2017_10_004 crossref_primary_10_1016_j_cie_2021_107343 crossref_primary_10_1007_s00170_014_6342_1 crossref_primary_10_1016_j_jmsy_2010_06_004 crossref_primary_10_1007_s13369_017_2763_0 crossref_primary_10_1080_00207543_2019_1685708 crossref_primary_10_1007_s10951_017_0543_z crossref_primary_10_1080_0951192X_2015_1130261 crossref_primary_10_1016_j_cor_2011_11_002 crossref_primary_10_1016_j_ress_2010_03_005 crossref_primary_10_1016_j_ejor_2024_05_029 crossref_primary_10_1016_j_compag_2020_105733 crossref_primary_10_1016_j_cie_2015_11_015 crossref_primary_10_1016_j_cie_2022_108400 crossref_primary_10_1016_j_omega_2011_12_007 crossref_primary_10_1016_j_omega_2014_11_002 crossref_primary_10_1155_2013_936814 crossref_primary_10_1080_17509653_2016_1255858 crossref_primary_10_1016_j_omega_2012_04_003 crossref_primary_10_1016_j_apm_2013_03_001 crossref_primary_10_1287_opre_2017_1659 crossref_primary_10_1057_jors_2014_122 crossref_primary_10_1108_JM2_02_2016_0011 crossref_primary_10_1007_s12351_015_0179_8 crossref_primary_10_1016_j_omega_2010_01_003 crossref_primary_10_1016_j_omega_2009_10_003 |
| Cites_doi | 10.1007/BF01580393 10.1016/S0305-0548(02)00074-6 10.1016/S0377-2217(03)00232-7 10.1057/palgrave.jors.2600791 10.1002/nav.10045 |
| ContentType | Journal Article |
| Copyright | 2006 Elsevier Ltd 2008 INIST-CNRS COPYRIGHT 2008 Elsevier Science Publishers Copyright Pergamon Press Inc. Oct 2008 |
| Copyright_xml | – notice: 2006 Elsevier Ltd – notice: 2008 INIST-CNRS – notice: COPYRIGHT 2008 Elsevier Science Publishers – notice: Copyright Pergamon Press Inc. Oct 2008 |
| DBID | AAYXX CITATION IQODW DKI X2L K9. |
| DOI | 10.1016/j.omega.2006.04.006 |
| DatabaseName | CrossRef Pascal-Francis RePEc IDEAS RePEc ProQuest Health & Medical Complete (Alumni) |
| DatabaseTitle | CrossRef ProQuest Health & Medical Complete (Alumni) |
| DatabaseTitleList | ProQuest Health & Medical Complete (Alumni) |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Business Applied Sciences |
| EISSN | 1873-5274 |
| EndPage | 894 |
| ExternalDocumentID | 1426348281 A177265790 eeejomega_v_3a36_3ay_3a2008_3ai_3a5_3ap_3a888_894_htm 20072515 10_1016_j_omega_2006_04_006 S0305048306000405 |
| Genre | Feature |
| GeographicLocations | United States |
| GeographicLocations_xml | – name: United States |
| GroupedDBID | --K --M -~X .~1 0R~ 13V 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 5VS 7-5 71M 8P~ 96U 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABJNI ABKBG ABMAC ABMVD ABUCO ABXDB ABYKQ ACBMB ACDAQ ACGFS ACHQT ACHRH ACNCT ACNTT ACRLP ADBBV ADEZE ADIYS ADMUD AEBSH AEKER AENEX AFACB AFAZI AFFNX AFKWA AFTJW AGHFR AGJBL AGQRV AGUBO AGUMN AGYEJ AHEHV AHHHB AHMBA AIEXJ AIKHN AITUG AJBFU AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ASPBG AVWKF AXJTR AZFZN BAAKF BDEBP BKOJK BKOMP BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA HAMUX HVGLF HZ~ IAO IEA IGG IHE IHR IOF IPO ITC J1W KOM LPU LXL LY1 M41 MO0 MS~ N95 O-L O9- OAUVE OHT OZT P-8 P-9 PC. PQQKQ Q38 R2- RIG ROL RPZ SDF SDG SDP SDS SES SEW SPCBC SSB SSD SSL SSZ T5K TAE TAF TN5 U5U VQA WUQ XI7 XPP XSW XYO YNT ZRQ ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADMHG ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS IPC ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 08R 0R 1 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K LOTEE LXI M MS NADUK PQEST QVA STF X X2L K9. |
| ID | FETCH-LOGICAL-c535t-96b6c49441df8d4b25a74173023adad88c451ea3a9ce028dca95dd3e7aafc4d13 |
| ISICitedReferencesCount | 32 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000254371100017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0483 |
| IngestDate | Mon Oct 06 18:37:11 EDT 2025 Sat Nov 29 12:03:48 EST 2025 Sat Nov 29 10:59:12 EST 2025 Wed Aug 18 03:51:22 EDT 2021 Mon Jul 21 09:15:55 EDT 2025 Tue Nov 18 22:43:08 EST 2025 Sat Nov 29 04:12:47 EST 2025 Fri Feb 23 02:30:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Integer programming Scheduling Availability constraints Tool change Tardiness Availability Production system Work period Replacement problem Machining Mixed integer programming Continuous time Modeling Optimization Delay Tool life Machine tool Tool wear Single machine |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c535t-96b6c49441df8d4b25a74173023adad88c451ea3a9ce028dca95dd3e7aafc4d13 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 236412601 |
| PQPubID | 46729 |
| PageCount | 7 |
| ParticipantIDs | proquest_journals_236412601 gale_infotracgeneralonefile_A177265790 gale_infotracacademiconefile_A177265790 repec_primary_eeejomega_v_3a36_3ay_3a2008_3ai_3a5_3ap_3a888_894_htm pascalfrancis_primary_20072515 crossref_primary_10_1016_j_omega_2006_04_006 crossref_citationtrail_10_1016_j_omega_2006_04_006 elsevier_sciencedirect_doi_10_1016_j_omega_2006_04_006 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-10-01 |
| PublicationDateYYYYMMDD | 2008-10-01 |
| PublicationDate_xml | – month: 10 year: 2008 text: 2008-10-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Exeter |
| PublicationPlace_xml | – name: Exeter – name: Oxford |
| PublicationSeriesTitle | Omega |
| PublicationTitle | Omega (Oxford) |
| PublicationYear | 2008 |
| Publisher | Elsevier Ltd Elsevier Elsevier Science Publishers Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier – name: Elsevier Science Publishers – name: Pergamon Press Inc |
| References | Rinnooy Kan (bib6) 1976 Akturk, Ghosh, Gunes (bib3) 2003; 50 Daniel (bib8) 1978 Qi, Chen, Tu (bib2) 1999; 50 Fisher (bib7) 1976; 11 Liao, Chen (bib5) 2003; 30 Groover (bib1) 1987 Akturk, Ghosh, Gunes (bib4) 2004; 157 Fisher (10.1016/j.omega.2006.04.006_bib7) 1976; 11 Liao (10.1016/j.omega.2006.04.006_bib5) 2003; 30 Qi (10.1016/j.omega.2006.04.006_bib2) 1999; 50 Rinnooy Kan (10.1016/j.omega.2006.04.006_bib6) 1976 Groover (10.1016/j.omega.2006.04.006_bib1) 1987 Akturk (10.1016/j.omega.2006.04.006_bib3) 2003; 50 Akturk (10.1016/j.omega.2006.04.006_bib4) 2004; 157 Daniel (10.1016/j.omega.2006.04.006_bib8) 1978 |
| References_xml | – year: 1987 ident: bib1 article-title: Automation, production systems, and computer integrated manufacturing – volume: 30 start-page: 1335 year: 2003 end-page: 1347 ident: bib5 article-title: Single-machine scheduling with periodic maintenance and nonresumable jobs publication-title: Computers and Operations Research – volume: 11 start-page: 229 year: 1976 end-page: 251 ident: bib7 article-title: A dual algorithm for the one-machine scheduling problem publication-title: Mathematical Programming – volume: 157 start-page: 784 year: 2004 end-page: 790 ident: bib4 article-title: Scheduling with tool changes to minimize total completion time: basic results and SPT performance publication-title: European Journal of Operational Research – volume: 50 start-page: 15 year: 2003 end-page: 30 ident: bib3 article-title: Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance publication-title: Naval Research Logistics – year: 1976 ident: bib6 article-title: Machine scheduling problems: classification, complexity and computations – volume: 50 start-page: 1071 year: 1999 end-page: 1078 ident: bib2 article-title: Scheduling the maintenance on a single machine publication-title: Journal of the Operational Research Society – year: 1978 ident: bib8 article-title: Applied nonparametric statistics – volume: 11 start-page: 229 year: 1976 ident: 10.1016/j.omega.2006.04.006_bib7 article-title: A dual algorithm for the one-machine scheduling problem publication-title: Mathematical Programming doi: 10.1007/BF01580393 – volume: 30 start-page: 1335 year: 2003 ident: 10.1016/j.omega.2006.04.006_bib5 article-title: Single-machine scheduling with periodic maintenance and nonresumable jobs publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(02)00074-6 – volume: 157 start-page: 784 year: 2004 ident: 10.1016/j.omega.2006.04.006_bib4 article-title: Scheduling with tool changes to minimize total completion time: basic results and SPT performance publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00232-7 – volume: 50 start-page: 1071 year: 1999 ident: 10.1016/j.omega.2006.04.006_bib2 article-title: Scheduling the maintenance on a single machine publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2600791 – volume: 50 start-page: 15 year: 2003 ident: 10.1016/j.omega.2006.04.006_bib3 article-title: Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance publication-title: Naval Research Logistics doi: 10.1002/nav.10045 – year: 1976 ident: 10.1016/j.omega.2006.04.006_bib6 – year: 1987 ident: 10.1016/j.omega.2006.04.006_bib1 – year: 1978 ident: 10.1016/j.omega.2006.04.006_bib8 |
| SSID | ssj0001803 |
| Score | 2.0533018 |
| Snippet | Traditional machine scheduling literature generally assumes that a machine is available at all times. Yet this assumption may not be accurate in real... |
| SourceID | proquest gale repec pascalfrancis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 888 |
| SubjectTerms | Analysis Applied sciences Availability constraints Exact sciences and technology Integer programming Job shops Mathematical optimization Mathematical programming Methods Operational research and scientific management Operational research. Management science Optimization Production management Production scheduling Scheduling Scheduling Tool change Integer programming Tardiness Availability constraints Scheduling, sequencing Studies Tardiness Tool change |
| Title | Optimization models for the tool change scheduling problem |
| URI | https://dx.doi.org/10.1016/j.omega.2006.04.006 http://econpapers.repec.org/article/eeejomega/v_3a36_3ay_3a2008_3ai_3a5_3ap_3a888-894.htm https://www.proquest.com/docview/236412601 |
| Volume | 36 |
| WOSCitedRecordID | wos000254371100017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-5274 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001803 issn: 0305-0483 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELZgRWgS4scALQymPCB4gKAmjpOYt6oqGjx0SAypb5ZjO90q2kVNmMp_zzm-ZCkbAx54sFtFTuL6Pt-d3fN9hLykOqRhrk3AlWJBXBQq4GkYBeCK0LRIGc-pI5tIp9NsNuOfkVGwaugE0tUq22x4-V9FDddA2Pbo7D-Iu3soXIDvIHSoQexQ_5Xgj0EJLPF0pSO6qbpYwtpm3HRnfd_AshbMDJ5Gb1hl-o7q8dLMZZOLdOPC37sNg_HRZIpxMcGXU0DXfGvnIOti0HA7C21vT-NQG8kXO2aZVj26_CQIA9bTdZnj42vNpuMqvqKR3ebA4t257Tb--WMTll-T__oXu9RFC9rtVHDD2G0yiAA9oLsGo4-T2afO4obZ0NFgY_fb7FJNHN-VF__OA0GTfK-UFUyPwvGabC08BmtTGtXzP04ekvu4cPBHTuCPyC2z2iMPcBHho4qu9sjd9ijDY_K-DwXfQcEHafoABd9CwXdQ8C-h4CMUnpCvHyYn46MAuTICxSirA57kiYo5OLe6yHScR0yCr5haSiippc4yFbPQSCq5MuBSaiU505qaVMpCxTBhn5Kd1fnK7BMfhppKGUY6NPC8IuLgw-U8lpFOuMll4pGoHT-hMJG85TP5JtqIwYVoBt1SnCZiGAv48Mjb7qbS5VG5uXnSCkagK-hcPAG4uvnG11aMwmIQOqUknjKBn2YTnYlRCMvJhKV86JFXWy3nLs37dQ0PtyDR9b_FpUcOWowIVASVsMQMoc3X55FxA5vuNmPMwvX7QlBJE6h-QGn4YKk8g8KglFBghgmYV-K0Xj77UycOyO7lHH9Odur1d_OC3FEX9Vm1PsQZ8xONZMFu |
| linkProvider | Elsevier |
| 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=Optimization+models+for+the+tool+change+scheduling+problem&rft.jtitle=Omega+%28Oxford%29&rft.au=CHEN%2C+Jen-Shiang&rft.date=2008-10-01&rft.pub=Elsevier&rft.issn=0305-0483&rft.volume=36&rft.issue=5&rft.spage=888&rft.epage=894&rft_id=info:doi/10.1016%2Fj.omega.2006.04.006&rft.externalDBID=n%2Fa&rft.externalDocID=20072515 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0483&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0483&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0483&client=summon |