An exact algorithm for single-machine scheduling without machine idle time
This study proposes an exact algorithm for the general single-machine scheduling problem without machine idle time to minimize the total job completion cost. Our algorithm is based on the Successive Sublimation Dynamic Programming (SSDP) method. Its major drawback is heavy memory usage to store dyna...
Uložené v:
| Vydané v: | Journal of Scheduling Ročník 12; číslo 6; s. 575 - 593 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Boston
Springer Science and Business Media LLC
01.12.2009
Springer US Springer Nature B.V |
| Predmet: | |
| ISSN: | 1094-6136, 1099-1425 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This study proposes an exact algorithm for the general single-machine scheduling problem without machine idle time to minimize the total job completion cost. Our algorithm is based on the Successive Sublimation Dynamic Programming (SSDP) method. Its major drawback is heavy memory usage to store dynamic programming states, although unnecessary states are eliminated in the course of the algorithm. To reduce both memory usage and computational efforts, several improvements to the previous algorithm based on the SSDP method are proposed. Numerical experiments show that our algorithm can optimally solve 300 jobs instances of the total weighted tardiness problem and the total weighted earliness-tardiness problem, and that it outperforms the previous algorithms specialized for these problems. |
|---|---|
| AbstractList | This study proposes an exact algorithm for the general single-machine scheduling problem without machine idle time to minimize the total job completion cost. Our algorithm is based on the Successive Sublimation Dynamic Programming (SSDP) method. Its major drawback is heavy memory usage to store dynamic programming states, although unnecessary states are eliminated in the course of the algorithm. To reduce both memory usage and computational efforts, several improvements to the previous algorithm based on the SSDP method are proposed. Numerical experiments show that our algorithm can optimally solve 300 jobs instances of the total weighted tardiness problem and the total weighted earliness-tardiness problem, and that it outperforms the previous algorithms specialized for these problems. [PUBLICATION ABSTRACT] This study proposes an exact algorithm for the general single-machine scheduling problem without machine idle time to minimize the total job completion cost. Our algorithm is based on the Successive Sublimation Dynamic Programming (SSDP) method. Its major drawback is heavy memory usage to store dynamic programming states, although unnecessary states are eliminated in the course of the algorithm. To reduce both memory usage and computational efforts, several improvements to the previous algorithm based on the SSDP method are proposed. Numerical experiments show that our algorithm can optimally solve 300 jobs instances of the total weighted tardiness problem and the total weighted earliness-tardiness problem, and that it outperforms the previous algorithms specialized for these problems. |
| Author | Shuji Fujikuma Mituhiko Araki Shunji Tanaka |
| Author_xml | – sequence: 1 givenname: Shunji surname: Tanaka fullname: Tanaka, Shunji email: tanaka@kuee.kyoto-u.ac.jp organization: Graduate School of Electrical Engineering, Kyoto University – sequence: 2 givenname: Shuji surname: Fujikuma fullname: Fujikuma, Shuji organization: Graduate School of Electrical Engineering, Kyoto University – sequence: 3 givenname: Mituhiko surname: Araki fullname: Araki, Mituhiko organization: Matsue College of Technology |
| BackLink | https://cir.nii.ac.jp/crid/1872835442513047168$$DView record in CiNii |
| BookMark | eNp9kM1OAyEUhYmpibX2AdxNjNtRLjMMsGwa_2ITN7omlGFazJSpQKO-jc_ik8k4GhMXDeEnl_NxuOcYjVznDEKngC8AY3YZAAsKOcY8TVHk9ACNU0nkUBI6-j6XeQVFdYSmIdhlEnKAkuMxup-5zLwpHTPVrjpv43qTNZ3PgnWr1uQbpdfWmSzotal3bSpmr0nT7eLnx--drVuTRbsxJ-iwUW0w0599gp6urx7nt_ni4eZuPlvkuiwh5jWBqtYCVEUFZYQQUTHR1GRJYalqEMwYziuuaAFMADTMaNPoNAQlTa1IMUFnw7tb373sTIjyudt5lywlKUhqGUqRRDCItO9C8KaRW283yr9LwLJPTQ6pyRSG7FOTNDHsH6NtVNF2Lnpl270kGciQXNzK-L8v7YPOB8hZm5z6FTgjvKBl30SBSwYVL74AuSaNkw |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2013_02_048 crossref_primary_10_1016_j_ejor_2018_06_004 crossref_primary_10_1080_00207543_2016_1185550 crossref_primary_10_1016_j_apm_2015_01_069 crossref_primary_10_1016_j_eswa_2021_116180 crossref_primary_10_1016_j_ejor_2016_02_003 crossref_primary_10_1007_s10479_014_1776_2 crossref_primary_10_1016_j_cor_2011_06_006 crossref_primary_10_1016_j_cor_2010_06_003 crossref_primary_10_1007_s10951_017_0549_6 crossref_primary_10_1080_00207543_2011_649799 crossref_primary_10_1016_j_ijpe_2012_08_020 crossref_primary_10_1109_TCBB_2019_2897302 crossref_primary_10_1016_j_cie_2010_10_006 crossref_primary_10_1016_j_ejor_2020_12_036 crossref_primary_10_1007_s00170_014_6262_0 crossref_primary_10_1287_ijoc_2014_0615 crossref_primary_10_1016_j_cie_2019_106003 crossref_primary_10_1287_ijoc_2018_0854 crossref_primary_10_1016_j_cor_2012_07_004 crossref_primary_10_1016_j_ejor_2017_10_020 crossref_primary_10_1016_j_cor_2010_10_017 crossref_primary_10_1007_s10951_020_00672_5 crossref_primary_10_1016_j_cie_2017_04_006 crossref_primary_10_1007_s10951_011_0242_0 crossref_primary_10_1007_s10951_016_0472_2 crossref_primary_10_1016_j_jmse_2022_10_001 crossref_primary_10_1287_ijoc_2022_0301 crossref_primary_10_1016_j_cie_2016_04_022 crossref_primary_10_1016_j_cor_2022_105936 crossref_primary_10_1016_j_ijpe_2019_107516 crossref_primary_10_1016_j_cor_2017_09_006 crossref_primary_10_1007_s10951_015_0428_y crossref_primary_10_1007_s10951_015_0429_x crossref_primary_10_1016_j_cor_2024_106844 crossref_primary_10_1016_j_ejor_2021_06_028 crossref_primary_10_1007_s12532_010_0019_z crossref_primary_10_1016_j_ejor_2019_10_037 crossref_primary_10_1016_j_omega_2021_102446 crossref_primary_10_1016_j_asoc_2016_03_027 crossref_primary_10_1287_ijoc_2015_0661 crossref_primary_10_1007_s12065_020_00556_9 crossref_primary_10_1057_s41274_016_0007_4 crossref_primary_10_1007_s10479_016_2251_z crossref_primary_10_1007_s10951_020_00640_z crossref_primary_10_1016_j_cor_2020_105171 crossref_primary_10_1016_j_ejor_2022_03_043 |
| Cites_doi | 10.1287/ijoc.12.2.111.11896 10.1016/S0377-2217(02)00438-1 10.1016/S0167-6377(03)00064-6 10.1016/S0305-0548(98)00081-1 10.1007/s10107-006-0013-4 10.1287/inte.15.2.10 10.1002/net.3230110207 10.1007/BF01586059 10.1287/ijoc.14.1.52.7712 10.1016/0166-218X(90)90104-K 10.1057/jors.1988.26 10.1287/opre.21.5.1114 10.1287/mnsc.16.1.93 10.1007/s101070050071 10.1287/opre.33.2.363 10.1287/ijoc.10.3.341 10.1016/0377-2217(94)90007-8 10.1287/ijoc.1080.0287 10.1007/s10107990047a |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC 2008 Springer Science+Business Media, LLC 2009 |
| Copyright_xml | – notice: Springer Science+Business Media, LLC 2008 – notice: Springer Science+Business Media, LLC 2009 |
| DBID | RYH AAYXX CITATION 3V. 7TA 7TB 7WY 7WZ 7X7 7XB 87Z 88C 8AL 8AO 8FD 8FE 8FG 8FI 8FJ 8FK 8FL ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG FYUFA F~G GHDGH GNUQQ HCIFZ JG9 JQ2 K60 K6~ K7- K9. L.- L.0 M0C M0N M0S M0T P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PYYUZ Q9U |
| DOI | 10.1007/s10951-008-0093-5 |
| DatabaseName | CiNii Complete CrossRef ProQuest Central (Corporate) Materials Business File Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Healthcare Administration Database (Alumni) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) ProQuest Central (Alumni Edition) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One Community College ProQuest Central Korea Engineering Research Database Business Premium Collection (Alumni) Health Research Premium Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection Materials Research Database ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ABI/INFORM Professional Standard ABI/INFORM Global Computing Database Health & Medical Collection (Alumni Edition) Healthcare Administration Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ABI/INFORM Collection China ProQuest Central Basic |
| DatabaseTitle | CrossRef Materials Research Database ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ABI/INFORM Complete Materials Business File ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest Health Management (Alumni Edition) Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection Health and Medicine Complete (Alumni Edition) ABI/INFORM Professional Standard ProQuest Central Korea ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest Health Management ABI/INFORM China ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1099-1425 |
| EndPage | 593 |
| ExternalDocumentID | 1888998451 10_1007_s10951_008_0093_5 |
| Genre | Feature |
| GroupedDBID | -Y2 .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1OC 203 29L 2J2 2JN 2JY 2KG 2LR 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 7WY 7X7 8AO 8FE 8FG 8FI 8FJ 8FL 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABIJN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADBBV ADHHG ADHIR ADHKG ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFFHD AFGCZ AFHIU AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHBYD AHMBA AHPBZ AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMVHM AMXSW AMYLF AMYQR AOCGG AQUVI ARAPS ARCSS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYQZM AZFZN AZQEC B-. BA0 BAPOH BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS BVXVI CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EHE EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC FYUFA GGCAI GGRSB GJIRD GNUQQ GNWQR GQ7 GQ8 GXS HCIFZ HF~ HG5 HG6 HLICF HMCUK HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV LAW LLZTM M0C M0T M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9G OAM P2P P62 P9M PF0 PHGZM PHGZT PJZUB PPXIY PQBIZ PQBZA PQGLB PQQKQ PROAC PT4 Q2X QOS R89 R9I ROL RPX RSV RYH S16 S27 S3B SAP SBE SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC TUS U2A UG4 UKHRP UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 XPP YLTOR Z45 ZMTXR ~A9 -57 -5G -BR -EM -~C 2P1 31~ 3V. 8-1 AAYZH ACXQS ADINQ AFBPY AFZJQ AHAVH AHSBF AJAOE ALIPV GQ6 GROUPED_ABI_INFORM_COMPLETE H13 LAK LH4 M0N O9J OVD RNI RZC RZD S1Z TEORI W99 XV2 Z7X Z83 Z88 AAMMB AAYXX AEFGJ AFOHR AGXDD AIDQK AIDYY ALUQN CITATION 7TA 7TB 7XB 8AL 8FD 8FK FR3 JG9 JQ2 K9. L.- L.0 PKEHL PQEST PQUKI Q9U |
| ID | FETCH-LOGICAL-c441t-d216dc91a659572229679fd2b51bad197ee8868a5317911f7ecefcfcf952fda23 |
| IEDL.DBID | M0C |
| ISICitedReferencesCount | 60 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000271272200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1094-6136 |
| IngestDate | Tue Nov 04 17:05:37 EST 2025 Sat Nov 29 01:47:22 EST 2025 Tue Nov 18 22:31:47 EST 2025 Fri Feb 21 02:36:56 EST 2025 Mon Nov 10 09:18:16 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | Single-machine scheduling Successive sublimation dynamic programming method Time-indexed formulation Exact algorithm Lagrangian relaxation |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c441t-d216dc91a659572229679fd2b51bad197ee8868a5317911f7ecefcfcf952fda23 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ORCID | 0000-0002-0181-743X |
| PQID | 232425149 |
| PQPubID | 43675 |
| PageCount | 19 |
| ParticipantIDs | proquest_journals_232425149 crossref_primary_10_1007_s10951_008_0093_5 crossref_citationtrail_10_1007_s10951_008_0093_5 springer_journals_10_1007_s10951_008_0093_5 nii_cinii_1872835442513047168 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-12-01 |
| PublicationDateYYYYMMDD | 2009-12-01 |
| PublicationDate_xml | – month: 12 year: 2009 text: 2009-12-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Boston |
| PublicationPlace_xml | – name: Boston – name: New York |
| PublicationTitle | Journal of Scheduling |
| PublicationTitleAbbrev | J Sched |
| PublicationYear | 2009 |
| Publisher | Springer Science and Business Media LLC Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer Science and Business Media LLC – name: Springer US – name: Springer Nature B.V |
| References | Christofides, Mingozzi, Toth (CR2) 1981; 11 Dyer, Wolsey (CR5) 1990; 26 van den Akker, van Hoesel, Savelsbergh (CR20) 1999; 85 Fisher (CR7) 1985; 15 Fisher (CR6) 1973; 21 Potts, Van Wassenhove (CR14) 1985; 33 CR19 Grosso, Della Croce, Tadei (CR8) 2004; 32 Pan, Shi (CR12) 2007; 110 CR17 Crauwels, Potts, Van Wassenhove (CR4) 1998; 10 CR9 CR16 Congram, Potts, van de Velde (CR3) 2002; 14 Sousa, Wolsey (CR18) 1992; 54 van den Akker, Hurkens, Savelsbergh (CR21) 2000; 12 Abdul-Razaq, Potts (CR1) 1988; 39 Péridy, Pinson, Rivreau (CR13) 2003; 148 Ibaraki, Nakamura (CR10) 1994; 76 Liaw (CR11) 1999; 26 Pritsker, Watters, Wolfe (CR15) 1969; 16 M. L. Fisher (93_CR6) 1973; 21 C.-F. Liaw (93_CR11) 1999; 26 Y. Pan (93_CR12) 2007; 110 M. E. Dyer (93_CR5) 1990; 26 T. Ibaraki (93_CR10) 1994; 76 A. A. B. Pritsker (93_CR15) 1969; 16 T. S. Abdul-Razaq (93_CR1) 1988; 39 A. Grosso (93_CR8) 2004; 32 M. L. Fisher (93_CR7) 1985; 15 L. Péridy (93_CR13) 2003; 148 J. P. Sousa (93_CR18) 1992; 54 C. N. Potts (93_CR14) 1985; 33 N. Christofides (93_CR2) 1981; 11 J. M. Akker van den (93_CR21) 2000; 12 93_CR19 J. M. Akker van den (93_CR20) 1999; 85 93_CR9 93_CR16 R. K. Congram (93_CR3) 2002; 14 H. A. J. Crauwels (93_CR4) 1998; 10 93_CR17 |
| References_xml | – volume: 12 start-page: 111 year: 2000 end-page: 124 ident: CR21 article-title: Time-indexed formulations for machine scheduling problems: Column generation publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.12.2.111.11896 – ident: CR19 – volume: 148 start-page: 591 year: 2003 end-page: 603 ident: CR13 article-title: Using short-term memory to minimize the weighted number of late jobs on a single machine publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00438-1 – ident: CR16 – volume: 32 start-page: 68 year: 2004 end-page: 72 ident: CR8 article-title: An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem publication-title: Operations Research Letters doi: 10.1016/S0167-6377(03)00064-6 – volume: 26 start-page: 679 year: 1999 end-page: 693 ident: CR11 article-title: A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(98)00081-1 – ident: CR17 – volume: 110 start-page: 543 year: 2007 end-page: 559 ident: CR12 article-title: On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems publication-title: Mathematical Programming, Series A doi: 10.1007/s10107-006-0013-4 – volume: 15 start-page: 10 year: 1985 end-page: 21 ident: CR7 article-title: An applications oriented guide to Lagrangian relaxation publication-title: Interfaces doi: 10.1287/inte.15.2.10 – ident: CR9 – volume: 11 start-page: 145 year: 1981 end-page: 164 ident: CR2 article-title: State–space relaxation procedures for the computation of bounds to routing problems publication-title: Networks doi: 10.1002/net.3230110207 – volume: 54 start-page: 353 year: 1992 end-page: 367 ident: CR18 article-title: A time indexed formulation of non-preemptive single machine scheduling problems publication-title: Mathematical Programming doi: 10.1007/BF01586059 – volume: 14 start-page: 52 year: 2002 end-page: 67 ident: CR3 article-title: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.14.1.52.7712 – volume: 26 start-page: 255 year: 1990 end-page: 270 ident: CR5 article-title: Formulating the single-machine sequencing problem with release dates as a mixed integer problem publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(90)90104-K – volume: 39 start-page: 141 year: 1988 end-page: 152 ident: CR1 article-title: Dynamic programming state–space relaxation for single-machine scheduling publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1988.26 – volume: 21 start-page: 1114 year: 1973 end-page: 1127 ident: CR6 article-title: Optimal solution of scheduling problems using Lagrange multipliers: part I publication-title: Operations Research doi: 10.1287/opre.21.5.1114 – volume: 16 start-page: 93 year: 1969 end-page: 108 ident: CR15 article-title: Multiproject scheduling with limited resources: a zero-one programming approach publication-title: Management Science doi: 10.1287/mnsc.16.1.93 – volume: 85 start-page: 541 year: 1999 end-page: 572 ident: CR20 article-title: A polyhedral approach to single-machine scheduling problems publication-title: Mathematical Programming doi: 10.1007/s101070050071 – volume: 33 start-page: 363 year: 1985 end-page: 377 ident: CR14 article-title: A branch and bound algorithm for the total weighted tardiness problem publication-title: Operations Research doi: 10.1287/opre.33.2.363 – volume: 10 start-page: 341 year: 1998 end-page: 350 ident: CR4 article-title: Local search heuristics for the single machine total weighted tardiness scheduling problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.10.3.341 – volume: 76 start-page: 72 year: 1994 end-page: 82 ident: CR10 article-title: A dynamic programming method for single machine scheduling publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)90007-8 – volume: 32 start-page: 68 year: 2004 ident: 93_CR8 publication-title: Operations Research Letters doi: 10.1016/S0167-6377(03)00064-6 – ident: 93_CR17 doi: 10.1287/ijoc.1080.0287 – volume: 10 start-page: 341 year: 1998 ident: 93_CR4 publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.10.3.341 – volume: 26 start-page: 679 year: 1999 ident: 93_CR11 publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(98)00081-1 – volume: 33 start-page: 363 year: 1985 ident: 93_CR14 publication-title: Operations Research doi: 10.1287/opre.33.2.363 – volume: 12 start-page: 111 year: 2000 ident: 93_CR21 publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.12.2.111.11896 – volume: 21 start-page: 1114 year: 1973 ident: 93_CR6 publication-title: Operations Research doi: 10.1287/opre.21.5.1114 – ident: 93_CR19 – volume: 110 start-page: 543 year: 2007 ident: 93_CR12 publication-title: Mathematical Programming, Series A doi: 10.1007/s10107-006-0013-4 – volume: 54 start-page: 353 year: 1992 ident: 93_CR18 publication-title: Mathematical Programming doi: 10.1007/BF01586059 – volume: 15 start-page: 10 year: 1985 ident: 93_CR7 publication-title: Interfaces doi: 10.1287/inte.15.2.10 – ident: 93_CR16 – volume: 11 start-page: 145 year: 1981 ident: 93_CR2 publication-title: Networks doi: 10.1002/net.3230110207 – volume: 16 start-page: 93 year: 1969 ident: 93_CR15 publication-title: Management Science doi: 10.1287/mnsc.16.1.93 – volume: 148 start-page: 591 year: 2003 ident: 93_CR13 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00438-1 – ident: 93_CR9 – volume: 76 start-page: 72 year: 1994 ident: 93_CR10 publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)90007-8 – volume: 85 start-page: 541 year: 1999 ident: 93_CR20 publication-title: Mathematical Programming doi: 10.1007/s10107990047a – volume: 39 start-page: 141 year: 1988 ident: 93_CR1 publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1988.26 – volume: 14 start-page: 52 year: 2002 ident: 93_CR3 publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.14.1.52.7712 – volume: 26 start-page: 255 year: 1990 ident: 93_CR5 publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(90)90104-K |
| SSID | ssib008811480 ssib001015385 ssj0008721 |
| Score | 2.1523242 |
| Snippet | This study proposes an exact algorithm for the general single-machine scheduling problem without machine idle time to minimize the total job completion cost.... |
| SourceID | proquest crossref springer nii |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 575 |
| SubjectTerms | Algorithms Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Dynamic programming Experiments Integer programming Operations Research/Decision Theory Optimization Production scheduling Scheduling Studies Supply Chain Management |
| SummonAdditionalLinks | – databaseName: SpringerLink Contemporary (1997 - Present) dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZS8QwEB68EH3wWBXXizz4pAQ23W2ORxFFUES88K2kSaqF3a7sVvHn-Fv8ZU66jRcqKIW-JE1DjplvMpn5ALa5ZkIirKUO9TPtSJtS1XKaqjTiiO8NN1Ui7esTcXoqb27UWR3HPQy33YNLspLUH4LdPCV85a5HM5zG4zCJ2k56vobzi-s38SvFKNgK7Ra0i9o8uDK_a-KTMhov8vwTzvziGq00zuH8v_q6AHM1wCR7oxWxCGOuaMB0uN_egPnA40Dqbd2A2Q9JCZfgeK8g7kmbkujubX-Ql3c9gsiW-EOFrqO96valI2gVo5bywezEn-X2H8qX51CW264jnrV-Ga4ODy73j2hNuUAN4qKS2ohxaxTTPs2g8FzfXKjMRmnMUm2ZEs5JyaXGnStQTGbCGZcZfFQcZVZH7RWYKPqFWwXCrdMyNbGwmepY09a6k-l2ZI02ylmbNqEVxj4xdT5yT4vRTd4zKftRTCqeTBzFJG7Cztsn96NkHL9V3sQJxab9m-Gq8EdcKKGYdzQyLpuwHqY6qfftMKnwJWJI1YTdMLPvpT_-a-1PtddhJqpZKFpsAybKwYPbhCnzWObDwVa1ml8BKz3sNg priority: 102 providerName: Springer Nature |
| Title | An exact algorithm for single-machine scheduling without machine idle time |
| URI | https://cir.nii.ac.jp/crid/1872835442513047168 https://link.springer.com/article/10.1007/s10951-008-0093-5 https://www.proquest.com/docview/232425149 |
| Volume | 12 |
| WOSCitedRecordID | wos000271272200003&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: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: 7WY dateStart: 20030101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: M0C dateStart: 20030101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: P5Z dateStart: 20030101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: K7- dateStart: 20030101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Healthcare Administration Database (ProQuest) customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: M0T dateStart: 20030101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthmanagement providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: BENPR dateStart: 20030101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Health & Medical customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: 7X7 dateStart: 20030101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1099-1425 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: RSV dateStart: 20030101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED-tG0LjgUEBrRur_MATk0WTNv54QmPahAZU1dhH4SVybAcqdelYM7Q_nzvX6dgk9oIinRQ5iSPd2ffp-wG8ESaRCs1a7lE_84FyBdc9b7guUoH2vRU2NNI--yyHQzUe61GszZnHsspmTwwbtZtZipG_C5oftbt-f_mLE2gUJVcjgkYL1siwoYq-L7395Uas5OLYFXow6CH1RZPUXJycI3z5kPtHn55nd9RSq5pM7lic95KkQfccbvznXz-Dp9HoZHsLKXkOK75qw-Om5r0NGw22A4tLvQ1P_mpU-AKO9irmb4ytmZn-wAnqnxcMrV1GgYap5xehItMz9JRRc9EBd0bx3dl1zZqhiZt6RkD2L-H08OBk_yOPKAzcoqlUc5cmwlmdGOo8KAn-W0hdurTIksK4REvvlRLK4GKWuHOW0ltfWrx0lpbOpP1XsFrNKr8JTDhvVGEz6Uo9cLZvzKA0_dRZY7V3ruhAr2FCbmOLckLKmOa3zZWJb3mAzkS-5VkH3i5fuVz053jo4R3kLH6aaILiQVEv4g_lHhOhOrDdcDGPS3meL1nYgd1GDG5H_znX1oPf2ob1NAJR9JLXsFpfXfsdeGR_15P5VRda8vwb0bHswtqHg-HoGO8-Sd4NAh7oCdJR9h3p8dezPzu5_CM |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VgngcKGyLWErBB7iALDbJxo8DQhVQteyy4lBQb8GxnRJpN1u6KY8f1f_YmSTeUiR66wFFysWJI8efZ8Yz4_kAngkTSYVmLfeon_lQuZzrgTdc57FA-94K2xTS_jKWk4k6ONCfVuA0nIWhtMogExtB7eaWfOSvGs2P2l2_OfrOiTSKgquBQaNFxcj__ok7tsXrvXc4vc_jeOf9_ttd3pEKcIuav-YujoSzOjJUSE8Sm7WQunBxnka5cZGW3isllEFsShQEhfTWFxYvncaFM1TnACX-9WGiJC2rkeRLwa9ke8wLd0y4I0tECKK2J_WIz77JNRjohKcX1OC1qiwvWLh_BWUbXbez9p_9pXtwtzOq2Xa7Cu7Diq96cDPk9PdgLXBXsE6U9eDOH4UY1-HDdsX8L2NrZqaHOKD624yhNc_IkTL1fNZknHq2QIQ7St0_ZOS_np_ULDSVbupZXc78Bny-kqE-gNVqXvmHwITzRuU2la7QQ2cTY4aFSWJnjdXeubwPgzDpme1KsBMTyDQ7Lx5NOMkaalDESZb24cXylaO2_shlD28hkrBrukcIR_LqER4othoJ1YfNgJqsE1WLbAmZPrwMsDtv_ee3Hl3a11O4tbv_cZyN9yajTbgdd6Qbg-gxrNbHJ34Lbtgfdbk4ftIsIQZfrxqNZ-VXUjA |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NT9RAFH9BNEQOoivGFdE56EUzYdvdzsfBECJuRMhmD2qIlzqdmWKT3S6wReVP47_jvbaziIncOJgmvbSdZtrfvO95P4BXwkRSoVnLPepnPlAu47rnDddZLNC-t8LWjbS_HsjRSB0e6vESXIS9MFRWGWRiLajdzFKMfKvW_Kjd9VbeVkWMd4fbxyecCKQo0RrYNBqE7PvzX-i9zd_t7eKvfh3Hww-f33_kLcEAt2gFVNzFkXBWR4aa6klithZS5y7OkigzLtLSe6WEMohTiUIhl9763OKhkzh3hnoeoPS_K9HFpGrCcfJtoQSUbLZ8ofeE3llfhIRqs2uPuO3ruoOe7vPkmkq8UxbFNWv3rwRtrfeGa__xF3sID1pjm-00q-MRLPmyAyuh1r8Da4HTgrUirgOrfzRofAyfdkrmfxtbMTM5wglVP6YMrXxGAZaJ59O6EtWzOSLfUUn_EaO49uysYuFS4SaeVcXUr8OXW5nqE1guZ6V_Ckw4b1RmE-lyPXC2b8wgN_3YWWO1dy7rQi8AILVta3ZiCJmkV02lCTNpTRmKmEmTLrxZPHLc9CW56eZNRBUOTecIoUnRPsIG5VwjobqwERCUtiJsni7g04W3AYJXV__5rmc3jvUSVhCE6cHeaH8D7sctF0cveg7L1emZ34R79mdVzE9f1KuJwffbBuMlL5FbVA |
| 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=An+exact+algorithm+for+single-machine+scheduling+without%C2%A0machine+idle+time&rft.jtitle=Journal+of+scheduling&rft.au=Tanaka%2C+Shunji&rft.au=Fujikuma%2C+Shuji&rft.au=Araki%2C+Mituhiko&rft.date=2009-12-01&rft.issn=1094-6136&rft.eissn=1099-1425&rft.volume=12&rft.issue=6&rft.spage=575&rft.epage=593&rft_id=info:doi/10.1007%2Fs10951-008-0093-5&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10951_008_0093_5 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1094-6136&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1094-6136&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1094-6136&client=summon |