A mixed integer programming approach for the single machine problem with unequal release dates
In this paper, we consider the problem of scheduling on a one-machine, a set of operations subject to unequal release dates with respect to the total completion time. This problem is known to be NP-hard in the strong sense. We propose an algorithm based on a Mixed Integer Linear Programming. This al...
Uloženo v:
| Vydáno v: | Computers & operations research Ročník 51; s. 323 - 330 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Kidlington
Elsevier Ltd
01.11.2014
Elsevier Pergamon Press Inc |
| Témata: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper, we consider the problem of scheduling on a one-machine, a set of operations subject to unequal release dates with respect to the total completion time. This problem is known to be NP-hard in the strong sense. We propose an algorithm based on a Mixed Integer Linear Programming. This algorithm includes the implementation of a preprocessing procedure together with the consideration of valid inequalities. A computer simulation to measure the performance of the algorithm shows that our proposed method outperforms state-of-the-art branch-and-bound algorithms. |
|---|---|
| AbstractList | In this paper, we consider the problem of scheduling on a one-machine, a set of operations subject to unequal release dates with respect to the total completion time. This problem is known to be NP-hard in the strong sense. We propose an algorithm based on a Mixed Integer Linear Programming. This algorithm includes the implementation of a preprocessing procedure together with the consideration of valid inequalities. A computer simulation to measure the performance of the algorithm shows that our proposed method outperforms state-of-the-art branch-and-bound algorithms. |
| Author | Serairi, Mehdi Kooli, Anis |
| Author_xml | – sequence: 1 givenname: Anis surname: Kooli fullname: Kooli, Anis email: anis.kooli@gmail.com organization: Ecole Supérieure des Sciences Economiques et Commerciales de Tunis, Université de Tunis. 4, Rue Abou Zakaria El Hafsi, 1089 Montfleury, Tunisie – sequence: 2 givenname: Mehdi surname: Serairi fullname: Serairi, Mehdi email: mehdi.serairi@hds.utc.fr organization: Université de Technologie de Compiègne, Heudiasyc, CNRS UMR 7253. Rue Roger Couttolenc, CS 60319, 60203 Compiègne Cedex, France |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28741434$$DView record in Pascal Francis https://hal.science/hal-01061623$$DView record in HAL |
| BookMark | eNp9kUFv1DAUhC1UJLaFH8DNEuLAIeG9xLGz4rSqoEVaiQtInLAc52XXq8TZ2t4W_n0dbeHAob5YHn0zGnku2YWfPTH2FqFEQPnxUNo5lBWgKEGWgPULtsJW1YWSzc8LtoIamgIa0b5ilzEeIB9V4Yr92vDJ_aaeO59oR4Efw7wLZpqc33FzzC9j93yYA0974jGrI_Epa87TwnYjTfzBpT0_ebo7mZEHGslE4r1JFF-zl4MZI715uq_Yjy-fv1_fFttvN1-vN9vCigpSIaFrRV91gmStVKcMDggkJEi1VnWjug6kBGFagX2lEJVQNKxNNzSV6NRA9RX7cM7dm1Efg5tM-KNn4_TtZqsXDRAkyqq-x8y-O7O5_t2JYtKH-RR8rqexaUTVts16od4_USZaMw7BeOviv-yqVQJFLTKnzpwNc4yBBm1dMsnNPgXjRo2gl4H0QeeB9DKQBpnr1NmJ_zn_hj_n-XT2UP7Me0dBR-vIW-pdIJt0P7tn3I_51qkk |
| CODEN | CMORAP |
| CitedBy_id | crossref_primary_10_1007_s12351_017_0308_7 crossref_primary_10_1016_j_cor_2021_105372 crossref_primary_10_1145_3431232 crossref_primary_10_3390_app11157040 crossref_primary_10_1155_2015_838925 crossref_primary_10_1109_ACCESS_2018_2815598 crossref_primary_10_1016_j_cor_2021_105512 crossref_primary_10_1109_ACCESS_2018_2789678 crossref_primary_10_1111_itor_12421 crossref_primary_10_1016_j_cor_2015_08_010 crossref_primary_10_1016_j_cie_2025_110931 |
| Cites_doi | 10.1002/nav.3800010110 10.1002/nav.3800030106 10.1137/0210014 10.1016/j.cor.2013.01.001 10.1287/opre.1060.0286 10.1016/j.ejor.2006.11.036 10.1007/s12532-011-0025-9 10.1007/BF01586059 10.1016/S0167-6377(02)00215-8 10.1002/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L 10.1016/0166-218X(83)90019-7 10.1016/0167-6377(92)90092-H 10.1016/j.ejor.2013.05.031 10.1016/j.cie.2004.06.004 10.1080/00207549108948029 10.1002/nav.3800290114 10.1093/comjnl/26.4.320 10.1057/palgrave.jors.2601389 10.1023/B:JOSH.0000046075.73409.7d 10.1016/0166-218X(90)90104-K 10.1023/A:1018961818782 10.1007/s10951-006-8789-x 10.1016/j.cie.2008.06.008 10.1002/nav.3800260315 10.1016/j.cor.2010.12.007 10.1016/0305-0548(95)00071-2 10.1016/S0167-5060(08)70356-X 10.1002/(SICI)1520-6750(199608)43:5<709::AID-NAV7>3.0.CO;2-9 10.1002/1520-6750(199012)37:6<967::AID-NAV3220370616>3.0.CO;2-K |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier Ltd 2015 INIST-CNRS Copyright Pergamon Press Inc. Nov 2014 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2014 Elsevier Ltd – notice: 2015 INIST-CNRS – notice: Copyright Pergamon Press Inc. Nov 2014 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D 1XC |
| DOI | 10.1016/j.cor.2014.06.013 |
| DatabaseName | CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business Applied Sciences |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 330 |
| ExternalDocumentID | oai:HAL:hal-01061623v1 3406676221 28741434 10_1016_j_cor_2014_06_013 S0305054814001713 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D 1XC |
| ID | FETCH-LOGICAL-c420t-60b84d2b4e6377b7a1f10e4606797357bb06604a841d2711747ef9abf524b7fe3 |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000341473200029&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Tue Oct 14 20:15:46 EDT 2025 Sun Nov 09 06:22:35 EST 2025 Wed Apr 02 07:24:48 EDT 2025 Sat Nov 29 03:23:38 EST 2025 Tue Nov 18 22:11:19 EST 2025 Fri Feb 23 02:33:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Mixed integer programming Valid inequalities Preprocessing Release dates Performance evaluation Computer simulation Branch and bound method Scheduling Makespan Implicit enumeration method NP hard problem Single machine Inequality |
| Language | English |
| License | CC BY 4.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c420t-60b84d2b4e6377b7a1f10e4606797357bb06604a841d2711747ef9abf524b7fe3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ORCID | 0000-0001-7694-601X |
| PQID | 1554288591 |
| PQPubID | 45870 |
| PageCount | 8 |
| ParticipantIDs | hal_primary_oai_HAL_hal_01061623v1 proquest_journals_1554288591 pascalfrancis_primary_28741434 crossref_citationtrail_10_1016_j_cor_2014_06_013 crossref_primary_10_1016_j_cor_2014_06_013 elsevier_sciencedirect_doi_10_1016_j_cor_2014_06_013 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-11-01 |
| PublicationDateYYYYMMDD | 2014-11-01 |
| PublicationDate_xml | – month: 11 year: 2014 text: 2014-11-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Kidlington |
| PublicationPlace_xml | – name: Kidlington – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2014 |
| Publisher | Elsevier Ltd Elsevier Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier – name: Pergamon Press Inc |
| References | Haouari, Kharbeche (bib24) 2013; 40 Chu (bib8) 1992; 39 Codato, Fischetti (bib10) 2006; 54 Deogun (bib13) 1983; 26 Guo, Lim, Rodriguez, Yu (bib23) 2004; 47 Chand, Traub, Uzsoy (bib4) 1996; 43 Hoogeveen, Van Norden, Van de Velde (bib18) 2006; 9 Dyer, Wolsey (bib16) 1990; 26 T׳Kindt, Della Croce, Esswein (bib34) 2004; 7 Chu (bib9) 1992; 12 Koch, Achterberg, Andersen, Bastert, Berthold, Bixby (bib27) 2011; 3 Lasserre JB, Queyranne M. Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling. In: Proceedings of the second IPCO conference. Pittsburgh: Carnegie-Mellon University; 1992. p. 136–49. Chand, Traub, Uzsoy (bib6) 1997; 70 Keha, Khowala, Fowler (bib26) 2009; 56 Rakrouki, Ladhari, T׳Kindt (bib31) 2012; 39 Ahmadi, Bagchi (bib1) 1990; 37 Bianco, Ricciardelli (bib3) 1982; 29 Della Croce, T׳Kindt (bib14) 2003; 31 Jouglet, Baptiste, Carlier (bib20) 2004 Liu, MacCarthy (bib30) 1991; 29 Chandra (bib7) 1979; 26 Baker (bib2) 1974 Conway, Maxwell, Miller (bib11) 1967 Sousa, Wolsey (bib33) 1992; 54 Chand, Traub, Uzsoy (bib5) 1996; 23 Graham, Lawler, Lenstra, Rinnooy Kan (bib22) 1979; 5 Hariri, Potts (bib25) 1983; 5 Smith (bib32) 1956; 3 Jouglet, Savourey, Carlier, Baptiste (bib21) 2008; 184 Lawler, Lenstra, Rinnooy Kan, Shmoys (bib29) 1993; vol. 4 Della Croce, T׳Kindt (bib15) 2002; 53 Dessouky, Deogun (bib12) 1981; 10 Gharbi, Ladhari, Msakni, Serairi (bib17) 2013; 231 Johnson (bib19) 1954; 1 Rakrouki (10.1016/j.cor.2014.06.013_bib31) 2012; 39 Keha (10.1016/j.cor.2014.06.013_bib26) 2009; 56 Smith (10.1016/j.cor.2014.06.013_bib32) 1956; 3 Bianco (10.1016/j.cor.2014.06.013_bib3) 1982; 29 Dessouky (10.1016/j.cor.2014.06.013_bib12) 1981; 10 Chand (10.1016/j.cor.2014.06.013_bib5) 1996; 23 Koch (10.1016/j.cor.2014.06.013_bib27) 2011; 3 Dyer (10.1016/j.cor.2014.06.013_bib16) 1990; 26 Chu (10.1016/j.cor.2014.06.013_bib9) 1992; 12 Baker (10.1016/j.cor.2014.06.013_bib2) 1974 Chand (10.1016/j.cor.2014.06.013_bib6) 1997; 70 Sousa (10.1016/j.cor.2014.06.013_bib33) 1992; 54 Ahmadi (10.1016/j.cor.2014.06.013_bib1) 1990; 37 Liu (10.1016/j.cor.2014.06.013_bib30) 1991; 29 Gharbi (10.1016/j.cor.2014.06.013_bib17) 2013; 231 Johnson (10.1016/j.cor.2014.06.013_bib19) 1954; 1 Chand (10.1016/j.cor.2014.06.013_bib4) 1996; 43 Della Croce (10.1016/j.cor.2014.06.013_bib15) 2002; 53 T׳Kindt (10.1016/j.cor.2014.06.013_bib34) 2004; 7 Hariri (10.1016/j.cor.2014.06.013_bib25) 1983; 5 Lawler (10.1016/j.cor.2014.06.013_bib29) 1993; vol. 4 Jouglet (10.1016/j.cor.2014.06.013_bib20) 2004 Graham (10.1016/j.cor.2014.06.013_bib22) 1979; 5 Chu (10.1016/j.cor.2014.06.013_bib8) 1992; 39 Chandra (10.1016/j.cor.2014.06.013_bib7) 1979; 26 Jouglet (10.1016/j.cor.2014.06.013_bib21) 2008; 184 Guo (10.1016/j.cor.2014.06.013_bib23) 2004; 47 Della Croce (10.1016/j.cor.2014.06.013_bib14) 2003; 31 10.1016/j.cor.2014.06.013_bib28 Conway (10.1016/j.cor.2014.06.013_bib11) 1967 Haouari (10.1016/j.cor.2014.06.013_bib24) 2013; 40 Codato (10.1016/j.cor.2014.06.013_bib10) 2006; 54 Hoogeveen (10.1016/j.cor.2014.06.013_bib18) 2006; 9 Deogun (10.1016/j.cor.2014.06.013_bib13) 1983; 26 |
| References_xml | – volume: 43 start-page: 709 year: 1996 end-page: 719 ident: bib4 article-title: Single-machine scheduling with dynamic arrivals publication-title: Naval Res Logist – volume: 26 start-page: 537 year: 1979 end-page: 544 ident: bib7 article-title: On publication-title: Naval Res Logist Q – volume: vol. 4 year: 1993 ident: bib29 article-title: Sequencing and scheduling publication-title: Handbooks in operations research and management science, Logistics of production and inventory – volume: 40 start-page: 1693 year: 2013 end-page: 1699 ident: bib24 article-title: An assignment-based lower bound for a class of two-machine flow shop problems publication-title: Comput Oper Res – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: bib22 article-title: Optimization and approximation in deterministic sequencing and scheduling publication-title: Ann Discr Math – volume: 3 start-page: 59 year: 1956 end-page: 66 ident: bib32 article-title: Various optimizers for single-state production publication-title: Naval Res Logist Q – volume: 23 start-page: 641 year: 1996 end-page: 651 ident: bib5 article-title: An iterative heuristic for the single-machine dynamic total completion time scheduling problem publication-title: Comput Oper Res – volume: 31 start-page: 142 year: 2003 end-page: 148 ident: bib14 article-title: Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem publication-title: Oper Res Lett – reference: Lasserre JB, Queyranne M. Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling. In: Proceedings of the second IPCO conference. Pittsburgh: Carnegie-Mellon University; 1992. p. 136–49. – year: 1967 ident: bib11 article-title: Theory of scheduling – volume: 26 start-page: 255 year: 1990 end-page: 270 ident: bib16 article-title: Formulating the single machine sequencing problem with release dates as a mixed integer program publication-title: Discr Appl Math – volume: 37 start-page: 967 year: 1990 end-page: 979 ident: bib1 article-title: Lower bounds for single-machine scheduling problems publication-title: Naval Res Logist – volume: 7 start-page: 429 year: 2004 end-page: 440 ident: bib34 article-title: Revisiting branch and bound search strategies for machine scheduling problems publication-title: J Sched – volume: 9 start-page: 559 year: 2006 end-page: 568 ident: bib18 article-title: Lower bounds for minimizing total completion time in a two-machine flow shop publication-title: J Sched – volume: 56 start-page: 357 year: 2009 end-page: 367 ident: bib26 article-title: Mixed integer programming formulations for single machine scheduling problems publication-title: Comput Ind Eng – volume: 53 start-page: 1275 year: 2002 end-page: 1280 ident: bib15 article-title: A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem publication-title: J Oper Res Soc – volume: 29 start-page: 1521 year: 1991 end-page: 1533 ident: bib30 article-title: Effective heuristics for the single machine sequencing problem with ready times publication-title: Int J Prod Res – volume: 1 start-page: 61 year: 1954 end-page: 68 ident: bib19 article-title: Optimal two- and three-stage production schedules with set up times included publication-title: Naval Res Logist Q – volume: 26 start-page: 320 year: 1983 end-page: 328 ident: bib13 article-title: On scheduling with ready times to minimize mean flow time publication-title: Comput J – volume: 184 start-page: 879 year: 2008 end-page: 899 ident: bib21 article-title: Dominance-based heuristics for one-machine total cost scheduling problems publication-title: Eur J Oper Res – volume: 12 start-page: 321 year: 1992 end-page: 330 ident: bib9 article-title: Efficient heuristics to minimize total flow time with release dates publication-title: Oper Res Lett – year: 1974 ident: bib2 article-title: Introduction to sequencing and scheduling – volume: 5 start-page: 99 year: 1983 end-page: 109 ident: bib25 article-title: An algorithm for single machine sequencing with release dates to minimize total weighted completion time publication-title: Discr Appl Math – volume: 54 start-page: 353 year: 1992 end-page: 367 ident: bib33 article-title: A time indexed formulation of non-preemptive single machine scheduling problems publication-title: Math Program – volume: 47 start-page: 123 year: 2004 end-page: 140 ident: bib23 article-title: Minimizing total flow time in single machine environment with release time publication-title: Comput Ind Eng – volume: 231 start-page: 69 year: 2013 end-page: 78 ident: bib17 article-title: The two-machine flowshop scheduling problem with sequence-independent setup times publication-title: Eur J Oper Res – volume: 70 start-page: 115 year: 1997 end-page: 125 ident: bib6 article-title: Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates publication-title: Ann Oper Res – volume: 39 start-page: 1257 year: 2012 end-page: 1264 ident: bib31 article-title: Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates publication-title: Comput Oper Res – volume: 54 start-page: 756 year: 2006 end-page: 766 ident: bib10 article-title: Combinatorial benders׳ cuts for mixed-integer linear programming publication-title: Oper Res – volume: 3 start-page: 103 year: 2011 end-page: 163 ident: bib27 article-title: MIPLIB 2010 publication-title: Math Program Comput – volume: 39 start-page: 265 year: 1992 end-page: 283 ident: bib8 article-title: A branch-and-bound algorithm to minimize total tardiness with different release dates publication-title: Naval Res Logist – volume: 10 start-page: 192 year: 1981 end-page: 202 ident: bib12 article-title: Sequencing jobs with unequal ready times to minimize mean flow time publication-title: SIAM J Comput – volume: 29 start-page: 151 year: 1982 end-page: 167 ident: bib3 article-title: Scheduling of a single machine to minimize total weighted completion time subject to release dates publication-title: Naval Res Logist Q – year: 2004 ident: bib20 article-title: Branch-and-bound algorithms for total weighted tardiness publication-title: Handbook of scheduling: algorithms, models and performance analysis – volume: 1 start-page: 61 year: 1954 ident: 10.1016/j.cor.2014.06.013_bib19 article-title: Optimal two- and three-stage production schedules with set up times included publication-title: Naval Res Logist Q doi: 10.1002/nav.3800010110 – volume: 3 start-page: 59 year: 1956 ident: 10.1016/j.cor.2014.06.013_bib32 article-title: Various optimizers for single-state production publication-title: Naval Res Logist Q doi: 10.1002/nav.3800030106 – year: 1967 ident: 10.1016/j.cor.2014.06.013_bib11 – volume: 10 start-page: 192 year: 1981 ident: 10.1016/j.cor.2014.06.013_bib12 article-title: Sequencing jobs with unequal ready times to minimize mean flow time publication-title: SIAM J Comput doi: 10.1137/0210014 – volume: 40 start-page: 1693 year: 2013 ident: 10.1016/j.cor.2014.06.013_bib24 article-title: An assignment-based lower bound for a class of two-machine flow shop problems publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.01.001 – volume: 54 start-page: 756 year: 2006 ident: 10.1016/j.cor.2014.06.013_bib10 article-title: Combinatorial benders׳ cuts for mixed-integer linear programming publication-title: Oper Res doi: 10.1287/opre.1060.0286 – volume: 184 start-page: 879 year: 2008 ident: 10.1016/j.cor.2014.06.013_bib21 article-title: Dominance-based heuristics for one-machine total cost scheduling problems publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2006.11.036 – volume: 3 start-page: 103 year: 2011 ident: 10.1016/j.cor.2014.06.013_bib27 article-title: MIPLIB 2010 publication-title: Math Program Comput doi: 10.1007/s12532-011-0025-9 – volume: 54 start-page: 353 year: 1992 ident: 10.1016/j.cor.2014.06.013_bib33 article-title: A time indexed formulation of non-preemptive single machine scheduling problems publication-title: Math Program doi: 10.1007/BF01586059 – ident: 10.1016/j.cor.2014.06.013_bib28 – volume: 31 start-page: 142 year: 2003 ident: 10.1016/j.cor.2014.06.013_bib14 article-title: Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem publication-title: Oper Res Lett doi: 10.1016/S0167-6377(02)00215-8 – year: 1974 ident: 10.1016/j.cor.2014.06.013_bib2 – volume: vol. 4 year: 1993 ident: 10.1016/j.cor.2014.06.013_bib29 article-title: Sequencing and scheduling – volume: 39 start-page: 265 year: 1992 ident: 10.1016/j.cor.2014.06.013_bib8 article-title: A branch-and-bound algorithm to minimize total tardiness with different release dates publication-title: Naval Res Logist doi: 10.1002/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L – volume: 5 start-page: 99 year: 1983 ident: 10.1016/j.cor.2014.06.013_bib25 article-title: An algorithm for single machine sequencing with release dates to minimize total weighted completion time publication-title: Discr Appl Math doi: 10.1016/0166-218X(83)90019-7 – volume: 12 start-page: 321 year: 1992 ident: 10.1016/j.cor.2014.06.013_bib9 article-title: Efficient heuristics to minimize total flow time with release dates publication-title: Oper Res Lett doi: 10.1016/0167-6377(92)90092-H – volume: 231 start-page: 69 year: 2013 ident: 10.1016/j.cor.2014.06.013_bib17 article-title: The two-machine flowshop scheduling problem with sequence-independent setup times publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2013.05.031 – year: 2004 ident: 10.1016/j.cor.2014.06.013_bib20 article-title: Branch-and-bound algorithms for total weighted tardiness – volume: 47 start-page: 123 year: 2004 ident: 10.1016/j.cor.2014.06.013_bib23 article-title: Minimizing total flow time in single machine environment with release time publication-title: Comput Ind Eng doi: 10.1016/j.cie.2004.06.004 – volume: 29 start-page: 1521 year: 1991 ident: 10.1016/j.cor.2014.06.013_bib30 article-title: Effective heuristics for the single machine sequencing problem with ready times publication-title: Int J Prod Res doi: 10.1080/00207549108948029 – volume: 29 start-page: 151 year: 1982 ident: 10.1016/j.cor.2014.06.013_bib3 article-title: Scheduling of a single machine to minimize total weighted completion time subject to release dates publication-title: Naval Res Logist Q doi: 10.1002/nav.3800290114 – volume: 26 start-page: 320 year: 1983 ident: 10.1016/j.cor.2014.06.013_bib13 article-title: On scheduling with ready times to minimize mean flow time publication-title: Comput J doi: 10.1093/comjnl/26.4.320 – volume: 53 start-page: 1275 year: 2002 ident: 10.1016/j.cor.2014.06.013_bib15 article-title: A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601389 – volume: 7 start-page: 429 year: 2004 ident: 10.1016/j.cor.2014.06.013_bib34 article-title: Revisiting branch and bound search strategies for machine scheduling problems publication-title: J Sched doi: 10.1023/B:JOSH.0000046075.73409.7d – volume: 26 start-page: 255 year: 1990 ident: 10.1016/j.cor.2014.06.013_bib16 article-title: Formulating the single machine sequencing problem with release dates as a mixed integer program publication-title: Discr Appl Math doi: 10.1016/0166-218X(90)90104-K – volume: 70 start-page: 115 year: 1997 ident: 10.1016/j.cor.2014.06.013_bib6 article-title: Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates publication-title: Ann Oper Res doi: 10.1023/A:1018961818782 – volume: 9 start-page: 559 year: 2006 ident: 10.1016/j.cor.2014.06.013_bib18 article-title: Lower bounds for minimizing total completion time in a two-machine flow shop publication-title: J Sched doi: 10.1007/s10951-006-8789-x – volume: 56 start-page: 357 year: 2009 ident: 10.1016/j.cor.2014.06.013_bib26 article-title: Mixed integer programming formulations for single machine scheduling problems publication-title: Comput Ind Eng doi: 10.1016/j.cie.2008.06.008 – volume: 26 start-page: 537 year: 1979 ident: 10.1016/j.cor.2014.06.013_bib7 article-title: On n/1/F¯ dynamic deterministic systems publication-title: Naval Res Logist Q doi: 10.1002/nav.3800260315 – volume: 39 start-page: 1257 year: 2012 ident: 10.1016/j.cor.2014.06.013_bib31 article-title: Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates publication-title: Comput Oper Res doi: 10.1016/j.cor.2010.12.007 – volume: 23 start-page: 641 year: 1996 ident: 10.1016/j.cor.2014.06.013_bib5 article-title: An iterative heuristic for the single-machine dynamic total completion time scheduling problem publication-title: Comput Oper Res doi: 10.1016/0305-0548(95)00071-2 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.cor.2014.06.013_bib22 article-title: Optimization and approximation in deterministic sequencing and scheduling publication-title: Ann Discr Math doi: 10.1016/S0167-5060(08)70356-X – volume: 43 start-page: 709 year: 1996 ident: 10.1016/j.cor.2014.06.013_bib4 article-title: Single-machine scheduling with dynamic arrivals publication-title: Naval Res Logist doi: 10.1002/(SICI)1520-6750(199608)43:5<709::AID-NAV7>3.0.CO;2-9 – volume: 37 start-page: 967 year: 1990 ident: 10.1016/j.cor.2014.06.013_bib1 article-title: Lower bounds for single-machine scheduling problems publication-title: Naval Res Logist doi: 10.1002/1520-6750(199012)37:6<967::AID-NAV3220370616>3.0.CO;2-K |
| SSID | ssj0000721 |
| Score | 2.1805105 |
| Snippet | In this paper, we consider the problem of scheduling on a one-machine, a set of operations subject to unequal release dates with respect to the total... |
| SourceID | hal proquest pascalfrancis crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 323 |
| SubjectTerms | Algorithms Applied sciences Computer Science Computer simulation Exact sciences and technology Integer programming Inventory control, production control. Distribution Linear programming Mathematical problems Mathematical programming Mixed integer programming Operational research and scientific management Operational research. Management science Operations Research Preprocessing Production scheduling Release dates Scheduling algorithms Scheduling, sequencing Studies Valid inequalities |
| Title | A mixed integer programming approach for the single machine problem with unequal release dates |
| URI | https://dx.doi.org/10.1016/j.cor.2014.06.013 https://www.proquest.com/docview/1554288591 https://hal.science/hal-01061623 |
| Volume | 51 |
| WOSCitedRecordID | wos000341473200029&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-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3da9swEBddOsbK6LZ0o1m7IsaeVgz-kCPn0YyW7qvsoYM8TVi2TFNaJ8RpyZ-_O-nkZC0t68NejBG2sH0_351Od79j7KMxNTjZlQ4ADHEgwEQFhamKQCI5VRqXYOMq22xCnp5m4_HoJ-XptradgGyabLkczf6rqGEMhI2ls48QdzcpDMA5CB2OIHY4_pPg88OrydJUjgjCzH0G1pWtRiQG8S65ECMFl5jDiimVWDNl28u46Ox1Y7Dk0rZVAVt3iLGBdt2Z9R0hWouf6czMKa-OGIS6SPO36dRVYeeOx8RnGBcTV-f-w5xXk_X4QySoEG-lphJM_0sdX6bXqUQi65Ri4iqKyb4mbh_mjup2UYQL-PJI0xoJS6saJSs75ffmb5mvLqnQ56tdKJhC4RQKc_awpfFmLNNR1mOb-Zej8deVpZa2Lq97A7_rbfP_bj3HfX7Lk3NMoH0xK1r4p2rXDOWOXbfOytkrtk2rDJ47dLxmG6bps2e-yKHPXnrRcdLtfba1xky5w37n3KKIE4r4Goq4RxEHFHFAEXco4oQiTijiiCJOKOKEIm5R9Ib9Oj46-3wSUCuOoBRxuAiGoc5EFWthhomUWhZRHYVGDDEMKZNUag2uayiKTERVLCNY5kpTjwpdp7HQsjbJW9Zrpo3ZZTytU0viB4q_xF3_TCdlUVdaapEMTRwNWOg_tCqJpx7bpVyqewU8YJ-6W2aOpOWhi4WXniIv03mPCpD40G0fQNLd9MjKfpJ_VzhmwyqwjLiBZz_4Cwjd5dhVAlYmYsD2PTIU6YxWoUsfZ0gk-e4xL7LHnq_-x33WW8yvzXv2tLxZTNr5AWH9D_X8vVI |
| 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=A+mixed+integer+programming+approach+for+the+single+machine+problem+with+unequal+release+dates&rft.jtitle=Computers+%26+operations+research&rft.au=Kooli%2C+Anis&rft.au=Serairi%2C+Mehdi&rft.date=2014-11-01&rft.issn=0305-0548&rft.volume=51&rft.spage=323&rft.epage=330&rft_id=info:doi/10.1016%2Fj.cor.2014.06.013&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2014_06_013 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |