Scheduling a single semi-continuous batching machine
This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tube-billets in the steel industry. Each heating furnace can be regarded as a semi-continuous batching machine, which can handle up to C jobs simultaneously. The jobs in the same bat...
Uložené v:
| Vydané v: | Omega (Oxford) Ročník 36; číslo 6; s. 992 - 1004 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Oxford
Elsevier Ltd
01.12.2008
Elsevier Elsevier Science Publishers Pergamon Press Inc |
| Edícia: | Omega |
| Predmet: | |
| ISSN: | 0305-0483, 1873-5274 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tube-billets in the steel industry. Each heating furnace can be regarded as a semi-continuous batching machine, which can handle up to
C jobs simultaneously. The jobs in the same batch enter and leave the machine semi-continuously, which differs from the traditional batching machine scheduling where the jobs in same batch have a starting time and a finishing time. In this paper the processing time of a batch depends on the capacity of the semi-continuous batching machine, the longest processing time of jobs in the batch and its size. The objectives are to schedule jobs on the machine so that the makespan and the total completion time are minimized. A schedule for a semi-continuous batching machine consists of a batching and sequencing for the batches. We propose the optimal properties of two different objective functions and present the different dynamic programming algorithms with a running time of
O
(
n
2
)
, respectively. |
|---|---|
| AbstractList | This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tube-billets in the steel industry. Each heating furnace can be regarded as a semi-continuous batching machine, which can handle up to C jobs simultaneously. The jobs in the same batch enter and leave the machine semi-continuously, which differs from the traditional batching machine scheduling where the jobs in same batch have a starting time and a finishing time. In this paper the processing time of a batch depends on the capacity of the semi-continuous batching machine, the longest processing time of jobs in the batch and its size. The objectives are to schedule jobs on the machine so that the makespan and the total completion time are minimized. A schedule for a semi-continuous batching machine consists of a batching and sequencing for the batches. We propose the optimal properties of two different objective functions and present the different dynamic programming algorithms with a running time of O(n2), respectively. This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tube-billets in the steel industry. Each heating furnace can be regarded as a semi-continuous batching machine, which can handle up to C jobs simultaneously. The jobs in the same batch enter and leave the machine semi-continuously, which differs from the traditional batching machine scheduling where the jobs in same batch have a starting time and a finishing time. In this paper the processing time of a batch depends on the capacity of the semi-continuous batching machine, the longest processing time of jobs in the batch and its size. The objectives are to schedule jobs on the machine so that the makespan and the total completion time are minimized. A schedule for a semi-continuous batching machine consists of a batching and sequencing for the batches. We propose the optimal properties of two different objective functions and present the different dynamic programming algorithms with a running time of O ( n 2 ) , respectively. This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tube-billets in the steel industry. Each heating furnace can be regarded as a semi-continuous batching machine, which can handle up to C jobs simultaneously. The jobs in the same batch enter and leave the machine semi-continuously, which differs from the traditional batching machine scheduling where the jobs in same batch have a starting time and a finishing time. In this paper the processing time of a batch depends on the capacity of the semi-continuous batching machine, the longest processing time of jobs in the batch and its size. The objectives are to schedule jobs on the machine so that the makespan and the total completion time are minimized. A schedule for a semi-continuous batching machine consists of a batching and sequencing for the batches. We propose the optimal properties of two different objective functions and present the different dynamic programming algorithms with a running time of O(n^sup 2^), respectively. [PUBLICATION ABSTRACT] This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tubebillets in the steel industry. Each heating furnace can be regarded as a semi-continuous batching machine, which can handle up to C jobs simultaneously. The jobs in the same batch enter and leave the machine semi-continuously, which differs from the traditional batching machine scheduling where the jobs in same batch have a starting time and a finishing time. In this paper the processing time of a batch depends on the capacity of the semi-continuous batching machine, the longest processing time of jobs in the batch and its size. The objectives are to schedule jobs on the machine so that the makespan and the total completion time are minimized. A schedule for a semi-continuous batching machine consists of a batching and sequencing for the batches. We propose the optimal properties of two different objective functions and present the different dynamic programming algorithms with a running time of O([n.sup.2]), respectively. |
| Audience | Trade Academic |
| Author | Zhao, Yufang Tang, Lixin |
| Author_xml | – sequence: 1 givenname: Lixin surname: Tang fullname: Tang, Lixin email: qhjytlx@mail.neu.edu.cn – sequence: 2 givenname: Yufang surname: Zhao fullname: Zhao, Yufang email: yufangzhao66@163.com |
| BackLink | http://econpapers.repec.org/article/eeejomega/v_3a36_3ay_3a2008_3ai_3a6_3ap_3a992-1004.htm$$DView record in RePEc |
| BookMark | eNqFUUtv1DAYtFArsS39BVxW3BP8ih8HDlUFBVGJA_RseZ3Pu44Se7GTSv33OA3iwAEO45E-zYylmSt0EVMEhN4S3BJMxPuhTRMcbUsxli0hLcbsFdoRJVnTUckv0A4z3DWYK_YaXZUyYIyJwmyH-Hd3gn4ZQzzu7b5UGmFfYAqNS3EOcUlL2R_s7E6rYrIrwxt06e1Y4OY3X6PHTx9_3H1uHr7df7m7fWgcF3Ju5IF42WutieosSO-07ZUCJzpPqdU9UMucFbLnB3AdFRgkAQ5Wau-dYJpdo3db7jmnnwuU2QxpybF-aSgTnAumaBU1m-hoRzAh-jRn644QIdux1uRDPd8SqSRhmuKq_7rpM5zBmXMOk83PBgCGlxLNk2GWifo8V9RGVaVQsZ7OFVpTQzDm5jRPNY1taS6nUjL4P4EEm3UbM5gtdt3GEGLqNtWl_3K5MNs51MqzDeN_vB82L9TmnwJkU1yA6KAPGdxs-hT-6f8F2l2sfQ |
| CODEN | OMEGA6 |
| CitedBy_id | crossref_primary_10_1002_nav_22221 crossref_primary_10_1016_j_omega_2012_06_001 crossref_primary_10_1080_00207543_2020_1820095 crossref_primary_10_1016_j_omega_2011_08_007 crossref_primary_10_1142_S0217595916500445 crossref_primary_10_3233_JIFS_191497 crossref_primary_10_1016_j_omega_2023_102958 crossref_primary_10_1007_s10951_017_0545_x crossref_primary_10_1016_j_ejor_2010_09_031 crossref_primary_10_1007_s10951_019_00623_9 crossref_primary_10_1016_j_omega_2018_06_006 crossref_primary_10_1109_TCST_2010_2060201 crossref_primary_10_1007_s10489_023_04786_z crossref_primary_10_1007_s42524_020_0126_0 crossref_primary_10_1057_jors_2010_88 crossref_primary_10_1016_j_cor_2019_104777 crossref_primary_10_1080_00207543_2010_495208 crossref_primary_10_1080_00207543_2022_2119294 crossref_primary_10_1016_j_cie_2015_09_004 crossref_primary_10_1016_j_omega_2022_102673 |
| Cites_doi | 10.1016/j.omega.2005.03.003 10.1016/S0377-2217(00)00240-X 10.1016/S0377-2217(99)00153-8 10.1016/0167-6377(93)90030-K 10.1016/0305-0548(94)90001-9 10.1287/opre.40.4.764 10.1016/S0167-6377(03)00007-5 10.1080/00207549308956847 10.1016/S0167-5060(08)70743-X 10.1287/opre.43.4.692 10.1016/S0305-0548(00)00098-8 10.1016/S0166-218X(00)00181-5 10.1016/0166-218X(93)90085-3 10.1287/opre.40.4.750 10.1016/S0377-2217(99)00041-7 10.1016/j.omega.2005.09.005 10.1016/0167-6377(86)90104-5 10.1007/BF02248589 10.1016/j.tcs.2004.01.038 10.1016/j.cor.2003.09.001 10.1080/00207540110073000 10.1016/j.omega.2005.04.004 10.1016/j.orl.2004.04.009 10.1287/opre.45.6.874 10.1080/002075499192020 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R |
| ContentType | Journal Article |
| Copyright | 2007 Elsevier Ltd COPYRIGHT 2008 Elsevier Science Publishers Copyright Pergamon Press Inc. Dec 2008 |
| Copyright_xml | – notice: 2007 Elsevier Ltd – notice: COPYRIGHT 2008 Elsevier Science Publishers – notice: Copyright Pergamon Press Inc. Dec 2008 |
| DBID | AAYXX CITATION DKI X2L K9. |
| DOI | 10.1016/j.omega.2007.11.003 |
| DatabaseName | CrossRef 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 |
| EISSN | 1873-5274 |
| EndPage | 1004 |
| ExternalDocumentID | 1452320531 A178713920 eeejomega_v_3a36_3ay_3a2008_3ai_3a6_3ap_3a992_1004_htm 10_1016_j_omega_2007_11_003 S0305048307001235 |
| Genre | Feature |
| GeographicLocations | United Kingdom |
| GeographicLocations_xml | – name: United Kingdom |
| 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 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-c467t-7b1f7d999185ae7fc9ad88ec65f22a9de2a3ca67d4bec5260e71e4ea79ffc6393 |
| ISICitedReferencesCount | 26 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000255311800008&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:11:37 EDT 2025 Sat Nov 29 12:09:53 EST 2025 Wed Aug 18 03:51:22 EDT 2021 Tue Nov 18 22:15:40 EST 2025 Sat Nov 29 04:12:47 EST 2025 Fri Feb 23 02:30:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | Dynamic programming algorithm Scheduling Semi-continuous batching machine |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c467t-7b1f7d999185ae7fc9ad88ec65f22a9de2a3ca67d4bec5260e71e4ea79ffc6393 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 236446382 |
| PQPubID | 46729 |
| PageCount | 13 |
| ParticipantIDs | proquest_journals_236446382 gale_infotracgeneralonefile_A178713920 repec_primary_eeejomega_v_3a36_3ay_3a2008_3ai_3a6_3ap_3a992_1004_htm crossref_primary_10_1016_j_omega_2007_11_003 crossref_citationtrail_10_1016_j_omega_2007_11_003 elsevier_sciencedirect_doi_10_1016_j_omega_2007_11_003 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-12-01 |
| PublicationDateYYYYMMDD | 2008-12-01 |
| PublicationDate_xml | – month: 12 year: 2008 text: 2008-12-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – 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 | Ikura, Gimple (bib14) 1986; 5 Coffman, Yannakakis, Magazine, Bantos (bib18) 1990; 26 Cheng, Yuan, Yang (bib16) 2005; 32 Lin, Cheng, Chou (bib17) 2007; 35 Potts, Kovalyov (bib3) 2000; 120 Liu, Yu (bib6) 2000; 105 Cheng, Chen, Oguz (bib19) 1994; 21 Tang, Liu, Rong, Yang (bib23) 2001; 133 Hochbaum, Landy (bib13) 1997; 45 Chandru, Lee, Uzoy (bib12) 1993; 13 Kalczynski, Kamburowski (bib1) 2007; 35 Lageweg BJ, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Computer aided complexity classification of deterministic scheduling problems. Research report BM138/81, Mathematics Centrum, Amsterdam, 1981. Li, Li, Wang, Liu (bib10) 2005; 33 Lenstra, Rinnooy Kan, Brucker (bib20) 1977; 1 Brucker, Gladky, Hoogeveen, Kovalyov, Potts, Tautenhahn (bib7) 1998; 1 Sevastjanov, Figat (bib26) 2007; 35 Lee, Uzsoy (bib5) 1999; 37 Sung, Choung, Hong, Kim (bib9) 2002; 29 Ahmadi, Ahmadi, Dasu, Tang (bib15) 1992; 39 Tang, Liu, Rong, Yang (bib24) 2000; 120 Tang, Luh, Liu, Fang (bib25) 2002; 40 Yuan, Liu, Ng, Cheng (bib8) 2004; 320 Webster, Baker (bib2) 1995; 43 Ng, Cheng, Yuan, Liu (bib22) 2003; 31 Lee, Uzsoy, Martin-Vega (bib4) 1992; 40 Albers, Brucker (bib21) 1993; 47 Chandru, Lee, Uzoy (bib11) 1993; 31 Yuan (10.1016/j.omega.2007.11.003_bib8) 2004; 320 Cheng (10.1016/j.omega.2007.11.003_bib19) 1994; 21 Albers (10.1016/j.omega.2007.11.003_bib21) 1993; 47 Ahmadi (10.1016/j.omega.2007.11.003_bib15) 1992; 39 Tang (10.1016/j.omega.2007.11.003_bib24) 2000; 120 Kalczynski (10.1016/j.omega.2007.11.003_bib1) 2007; 35 Chandru (10.1016/j.omega.2007.11.003_bib12) 1993; 13 Tang (10.1016/j.omega.2007.11.003_bib25) 2002; 40 Cheng (10.1016/j.omega.2007.11.003_bib16) 2005; 32 Lee (10.1016/j.omega.2007.11.003_bib5) 1999; 37 Chandru (10.1016/j.omega.2007.11.003_bib11) 1993; 31 Hochbaum (10.1016/j.omega.2007.11.003_bib13) 1997; 45 Ng (10.1016/j.omega.2007.11.003_bib22) 2003; 31 Li (10.1016/j.omega.2007.11.003_bib10) 2005; 33 Ikura (10.1016/j.omega.2007.11.003_bib14) 1986; 5 10.1016/j.omega.2007.11.003_bib27 Sung (10.1016/j.omega.2007.11.003_bib9) 2002; 29 Lee (10.1016/j.omega.2007.11.003_bib4) 1992; 40 Coffman (10.1016/j.omega.2007.11.003_bib18) 1990; 26 Tang (10.1016/j.omega.2007.11.003_bib23) 2001; 133 Sevastjanov (10.1016/j.omega.2007.11.003_bib26) 2007; 35 Potts (10.1016/j.omega.2007.11.003_bib3) 2000; 120 Webster (10.1016/j.omega.2007.11.003_bib2) 1995; 43 Lenstra (10.1016/j.omega.2007.11.003_bib20) 1977; 1 Brucker (10.1016/j.omega.2007.11.003_bib7) 1998; 1 Lin (10.1016/j.omega.2007.11.003_bib17) 2007; 35 Liu (10.1016/j.omega.2007.11.003_bib6) 2000; 105 |
| References_xml | – volume: 120 start-page: 423 year: 2000 end-page: 435 ident: bib24 article-title: A mathematical programming model for scheduling steelmaking-continuous casting production publication-title: European Journal of Operational Research – volume: 32 start-page: 849 year: 2005 end-page: 859 ident: bib16 article-title: Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times publication-title: Computers & Operation Research – volume: 5 start-page: 61 year: 1986 end-page: 65 ident: bib14 article-title: Scheduling algorithms for a single batch processing machine publication-title: Operations Research Letters – volume: 40 start-page: 55 year: 2002 end-page: 70 ident: bib25 article-title: Steel-making process scheduling using Lagrangian relaxation publication-title: International Journal of Production Research – volume: 31 start-page: 2097 year: 1993 end-page: 2121 ident: bib11 article-title: Minimizing total completion time on batch processing machines publication-title: International Journal of Production Research – volume: 45 start-page: 874 year: 1997 end-page: 885 ident: bib13 article-title: Scheduling semiconductor burn-in operations to minimize total flowtime publication-title: Operations Research – volume: 43 start-page: 692 year: 1995 end-page: 703 ident: bib2 article-title: Scheduling groups of jobs on a singe machine publication-title: Operation Research – volume: 320 start-page: 199 year: 2004 end-page: 212 ident: bib8 article-title: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan publication-title: Theoretical Computer Science – volume: 40 start-page: 764 year: 1992 end-page: 775 ident: bib4 article-title: Efficient algorithms for scheduling semiconductor burn-in operations publication-title: Operations Research – volume: 13 start-page: 61 year: 1993 end-page: 65 ident: bib12 article-title: Minimizing total completion time on a batch processing machines with job families publication-title: Operation Research Letters – volume: 1 start-page: 31 year: 1998 end-page: 54 ident: bib7 article-title: Scheduling a batching machine publication-title: Journal of Scheduling – volume: 120 start-page: 228 year: 2000 end-page: 249 ident: bib3 article-title: Scheduling with batching publication-title: European Journal of Operational Research – volume: 105 start-page: 129 year: 2000 end-page: 136 ident: bib6 article-title: Scheduling one batch processor subject to job release dates publication-title: Discrete Applied Mathematics – volume: 33 start-page: 157 year: 2005 end-page: 164 ident: bib10 article-title: Minimizing makespan on a single batching machine with release times and non-identical job sizes publication-title: Operations Research Letters – volume: 26 start-page: 135 year: 1990 end-page: 147 ident: bib18 article-title: Batch sizing and job sequencing on a single machine publication-title: Annals of Operations Research – volume: 37 start-page: 219 year: 1999 end-page: 236 ident: bib5 article-title: Minimizing makespan on a single batch processing machine with dynamic job arrivals publication-title: International Journal of Production Research – volume: 35 start-page: 143 year: 2007 end-page: 151 ident: bib17 article-title: Scheduling in an assembly-type production chain with batch transfer publication-title: Omega – volume: 47 start-page: 87 year: 1993 end-page: 107 ident: bib21 article-title: The complexity of one-machine batching problems publication-title: Discrete Applied Mathematics – volume: 21 start-page: 717 year: 1994 end-page: 721 ident: bib19 article-title: One-machine batching and sequencing of multiple-type items publication-title: Computers and Operations Research – volume: 31 start-page: 323 year: 2003 end-page: 326 ident: bib22 article-title: On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, releasee dates and identical processing times publication-title: Operations Research Letters – volume: 1 start-page: 343 year: 1977 end-page: 362 ident: bib20 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics – volume: 133 start-page: 1 year: 2001 end-page: 20 ident: bib23 article-title: A review of planning and scheduling systems and methods for integrated steel production publication-title: European Journal of Operational Research – volume: 35 start-page: 505 year: 2007 end-page: 523 ident: bib26 article-title: Aggregation of aggregating modes in MCDM: synthesis of Type 2 and Level 2 fuzzy sets publication-title: Omega – volume: 35 start-page: 53 year: 2007 end-page: 60 ident: bib1 article-title: On the NEH heuristic for minimizing the makespan in permutation flow shops publication-title: Omega – volume: 29 start-page: 995 year: 2002 end-page: 1007 ident: bib9 article-title: Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals publication-title: Computers & Operation Research – reference: Lageweg BJ, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Computer aided complexity classification of deterministic scheduling problems. Research report BM138/81, Mathematics Centrum, Amsterdam, 1981. – volume: 39 start-page: 750 year: 1992 end-page: 763 ident: bib15 article-title: Batching and scheduling jobs on batch and discrete processors publication-title: Operations Research – volume: 35 start-page: 53 year: 2007 ident: 10.1016/j.omega.2007.11.003_bib1 article-title: On the NEH heuristic for minimizing the makespan in permutation flow shops publication-title: Omega doi: 10.1016/j.omega.2005.03.003 – volume: 133 start-page: 1 year: 2001 ident: 10.1016/j.omega.2007.11.003_bib23 article-title: A review of planning and scheduling systems and methods for integrated steel production publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(00)00240-X – volume: 120 start-page: 228 year: 2000 ident: 10.1016/j.omega.2007.11.003_bib3 article-title: Scheduling with batching publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00153-8 – volume: 13 start-page: 61 year: 1993 ident: 10.1016/j.omega.2007.11.003_bib12 article-title: Minimizing total completion time on a batch processing machines with job families publication-title: Operation Research Letters doi: 10.1016/0167-6377(93)90030-K – volume: 21 start-page: 717 year: 1994 ident: 10.1016/j.omega.2007.11.003_bib19 article-title: One-machine batching and sequencing of multiple-type items publication-title: Computers and Operations Research doi: 10.1016/0305-0548(94)90001-9 – volume: 40 start-page: 764 year: 1992 ident: 10.1016/j.omega.2007.11.003_bib4 article-title: Efficient algorithms for scheduling semiconductor burn-in operations publication-title: Operations Research doi: 10.1287/opre.40.4.764 – volume: 31 start-page: 323 year: 2003 ident: 10.1016/j.omega.2007.11.003_bib22 article-title: On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, releasee dates and identical processing times publication-title: Operations Research Letters doi: 10.1016/S0167-6377(03)00007-5 – volume: 31 start-page: 2097 year: 1993 ident: 10.1016/j.omega.2007.11.003_bib11 article-title: Minimizing total completion time on batch processing machines publication-title: International Journal of Production Research doi: 10.1080/00207549308956847 – volume: 1 start-page: 343 year: 1977 ident: 10.1016/j.omega.2007.11.003_bib20 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70743-X – volume: 43 start-page: 692 year: 1995 ident: 10.1016/j.omega.2007.11.003_bib2 article-title: Scheduling groups of jobs on a singe machine publication-title: Operation Research doi: 10.1287/opre.43.4.692 – volume: 29 start-page: 995 year: 2002 ident: 10.1016/j.omega.2007.11.003_bib9 article-title: Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals publication-title: Computers & Operation Research doi: 10.1016/S0305-0548(00)00098-8 – volume: 105 start-page: 129 year: 2000 ident: 10.1016/j.omega.2007.11.003_bib6 article-title: Scheduling one batch processor subject to job release dates publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(00)00181-5 – volume: 47 start-page: 87 year: 1993 ident: 10.1016/j.omega.2007.11.003_bib21 article-title: The complexity of one-machine batching problems publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(93)90085-3 – volume: 39 start-page: 750 year: 1992 ident: 10.1016/j.omega.2007.11.003_bib15 article-title: Batching and scheduling jobs on batch and discrete processors publication-title: Operations Research doi: 10.1287/opre.40.4.750 – volume: 120 start-page: 423 year: 2000 ident: 10.1016/j.omega.2007.11.003_bib24 article-title: A mathematical programming model for scheduling steelmaking-continuous casting production publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00041-7 – volume: 35 start-page: 505 year: 2007 ident: 10.1016/j.omega.2007.11.003_bib26 article-title: Aggregation of aggregating modes in MCDM: synthesis of Type 2 and Level 2 fuzzy sets publication-title: Omega doi: 10.1016/j.omega.2005.09.005 – volume: 5 start-page: 61 year: 1986 ident: 10.1016/j.omega.2007.11.003_bib14 article-title: Scheduling algorithms for a single batch processing machine publication-title: Operations Research Letters doi: 10.1016/0167-6377(86)90104-5 – volume: 26 start-page: 135 year: 1990 ident: 10.1016/j.omega.2007.11.003_bib18 article-title: Batch sizing and job sequencing on a single machine publication-title: Annals of Operations Research doi: 10.1007/BF02248589 – volume: 320 start-page: 199 year: 2004 ident: 10.1016/j.omega.2007.11.003_bib8 article-title: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2004.01.038 – volume: 32 start-page: 849 year: 2005 ident: 10.1016/j.omega.2007.11.003_bib16 article-title: Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times publication-title: Computers & Operation Research doi: 10.1016/j.cor.2003.09.001 – volume: 40 start-page: 55 year: 2002 ident: 10.1016/j.omega.2007.11.003_bib25 article-title: Steel-making process scheduling using Lagrangian relaxation publication-title: International Journal of Production Research doi: 10.1080/00207540110073000 – ident: 10.1016/j.omega.2007.11.003_bib27 – volume: 35 start-page: 143 year: 2007 ident: 10.1016/j.omega.2007.11.003_bib17 article-title: Scheduling in an assembly-type production chain with batch transfer publication-title: Omega doi: 10.1016/j.omega.2005.04.004 – volume: 33 start-page: 157 year: 2005 ident: 10.1016/j.omega.2007.11.003_bib10 article-title: Minimizing makespan on a single batching machine with release times and non-identical job sizes publication-title: Operations Research Letters doi: 10.1016/j.orl.2004.04.009 – volume: 45 start-page: 874 year: 1997 ident: 10.1016/j.omega.2007.11.003_bib13 article-title: Scheduling semiconductor burn-in operations to minimize total flowtime publication-title: Operations Research doi: 10.1287/opre.45.6.874 – volume: 37 start-page: 219 year: 1999 ident: 10.1016/j.omega.2007.11.003_bib5 article-title: Minimizing makespan on a single batch processing machine with dynamic job arrivals publication-title: International Journal of Production Research doi: 10.1080/002075499192020 – volume: 1 start-page: 31 year: 1998 ident: 10.1016/j.omega.2007.11.003_bib7 article-title: Scheduling a batching machine publication-title: Journal of Scheduling doi: 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R |
| SSID | ssj0001803 |
| Score | 2.0182514 |
| Snippet | This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tube-billets in the steel industry. Each... This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tubebillets in the steel industry. Each... |
| SourceID | proquest gale repec crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 992 |
| SubjectTerms | Algorithms Analysis Batch processing Dynamic programming Dynamic programming algorithm Heating Production scheduling Remote job entry Scheduling Scheduling Semi-continuous batching machine Dynamic programming algorithm Semi-continuous batching machine Steel industry Studies |
| Title | Scheduling a single semi-continuous batching machine |
| URI | https://dx.doi.org/10.1016/j.omega.2007.11.003 http://econpapers.repec.org/article/eeejomega/v_3a36_3ay_3a2008_3ai_3a6_3ap_3a992-1004.htm https://www.proquest.com/docview/236446382 |
| Volume | 36 |
| WOSCitedRecordID | wos000255311800008&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/eLvHCXMwtV1bb9MwFLagQ4gXxFWUAcoD4mUE5eLEzmMFQ4DQQKJIhRfL8WVLtWZVL1P373d8S0onpvHAg63KbRLH3_Hx8enxdxB6TXSdyqLQccUljbHkOuZlTmKsK57Uok6wxjbZBDk6opNJ9d1nb1vadAKkbelmU83_K9TQBmCbo7P_AHd3U2iAzwA61AA71DcC_gfAINf2lDk_MJ6AU3WwVLMmNlHpTbs2Ma81KGDreprZWMo_woG-zdQxtyykGxf43rkKxt63_LXZNJ1M_T7h1tv6a625XwWDE4HuBGR0p1uCQulj8rf0UW7i_LDLOxOUp2Mv8UKyrQkrl-LuioZ2zoLpuzPzMo5C0rCoJnm_IHVhgqMU1AmYqFlyG-1lpKjoAO2NPh9OvnSLbUoTlwHb9y0QS9kQvivP-Jvxsbsaw05loeZKbJka4wfovt8jRCOH7UN0S7WP0N1wROExwj3EEY8cxNEOxFGAOPIQP0E_Px6O33-KffaLWMDitYpJnWoijf1OC66IFmY2USXKQmcZr6TKeC54SSSGaVjAtlSRVGHFSaW1ALszf4oG7VmrnqHI3ErBl4QIgiUuOSWkEFRKTM3fqmSIsjAsTHhqeJOh5JSFGMAps2NpkpYS2DQaRtkhettdNHfMKNf_vAzjzbxx54w2BpJx_YVvDDrMSBF0Shw7OnZ4M8NcxnoZGaL9gB_z83HJTH4EDGtMNkQfLKRdX5VSU_ewc5bzvITqAopNy5rzBoppmkMBUTbU3pidrGbPb9qbfXSvn2gv0GC1WKuX6I44XzXLxSsvxpd9T529 |
| 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=Scheduling+a+single+semi-continuous+batching+machine&rft.jtitle=Omega+%28Oxford%29&rft.au=Tang%2C+Lixin&rft.au=Zhao%2C+Yufang&rft.date=2008-12-01&rft.pub=Elsevier+Science+Publishers&rft.issn=0305-0483&rft.volume=36&rft.issue=6&rft.spage=992&rft_id=info:doi/10.1016%2Fj.omega.2007.11.003&rft.externalDocID=A178713920 |
| 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 |