Fixed interval scheduling: Models, applications, computational complexity and algorithms
The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed only in one of its intervals on one of the available machines, or is not processed at all. A decision has to be made about a subset of the jobs...
Saved in:
| Published in | European journal of operational research Vol. 178; no. 2; pp. 331 - 342 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Amsterdam
Elsevier B.V
16.04.2007
Elsevier Elsevier Sequoia S.A |
| Series | European Journal of Operational Research |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0377-2217 1872-6860 |
| DOI | 10.1016/j.ejor.2006.01.049 |
Cover
| Abstract | The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed only in one of its intervals on one of the available machines, or is not processed at all. A decision has to be made about a subset of the jobs to be processed and their assignment to the processing intervals such that the intervals on the same machine do not intersect. These problems arise naturally in different real-life operations planning situations, including the assignment of transports to loading/unloading terminals, work planning for personnel, computer wiring, bandwidth allocation of communication channels, printed circuit board manufacturing, gene identification and examining computer memory structures. We present a general formulation of the interval scheduling problem, show its relations to cognate problems in graph theory, and survey existing models, results on computational complexity and solution algorithms. |
|---|---|
| AbstractList | The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed only in one of its intervals on one of the available machines, or is not processed at all. A decision has to be made about a subset of the jobs to be processed and their assignment to the processing intervals such that the intervals on the same machine do not intersect. These problems arise naturally in different real-life operations planning situations, including the assignment of transports to loading/unloading terminals, work planning for personnel, computer wiring, bandwidth allocation of communication channels, printed circuit board manufacturing, gene identification and examining computer memory structures. We present a general formulation of the interval scheduling problem, show its relations to cognate problems in graph theory, and survey existing models, results on computational complexity and solution algorithms. The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed only in one of its intervals on one of the available machines, or is not processed at all. A decision has to be made about a subset of the jobs to be processed and their assignment to the processing intervals such that the intervals on the same machine do not intersect. These problems arise naturally in different real-life operations planning situations, including the assignment of transports to loading/unloading terminals, work planning for personnel, computer wiring, bandwidth allocation of communication channels, printed circuit board manufacturing, gene identification and examining computer memory structures. We present a general formulation of the interval scheduling problem, show its relations to cognate problems in graph theory, and survey existing models, results on computational complexity and solution algorithms. [PUBLICATION ABSTRACT] |
| Author | Kovalyov, Mikhail Y. Ng, C.T. Cheng, T.C. Edwin |
| Author_xml | – sequence: 1 givenname: Mikhail Y. surname: Kovalyov fullname: Kovalyov, Mikhail Y. email: koval@newman.bas-net.by organization: Faculty of Economics, Belarus State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus, Skorini 4, 220050 Minsk, Belarus – sequence: 2 givenname: C.T. surname: Ng fullname: Ng, C.T. email: lgtctng@polyu.edu.hk organization: Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong – sequence: 3 givenname: T.C. Edwin surname: Cheng fullname: Cheng, T.C. Edwin email: lgtcheng@polyu.edu.hk organization: Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18402076$$DView record in Pascal Francis http://econpapers.repec.org/article/eeeejores/v_3a178_3ay_3a2007_3ai_3a2_3ap_3a331-342.htm$$DView record in RePEc |
| BookMark | eNp9UcFu1DAQtVCR2BZ-gFOExI2kY8exE8QFVS0giriAxM3y2pOuo2wcbO-q-_c4pAKph1oaj5_03sx43jk5m_yEhLymUFGg4nKocPChYgCiAloB756RDW0lK0Ur4IxsoJayZIzKF-Q8xgEAaEObDfl14-7RFm5KGI56LKLZoT2Mbrp7X3zzFsf4rtDzPDqjk_NTRsbv50P6izJ_QSPeu3Qq9GQLPd754NJuH1-S570eI756yBfk5831j6vP5e33T1-uPt6WhssulaKzUlgOUmq0crvlmOGWmV7IvmslSqRbrCnojkMn6553tYC-0S3jwjYa6wvyZq07B__7gDGpwR9CHi0qBpzy_NMmk76upIAzGjUHt9fhpDCfvDaM6qhqTWWb71OOvEaZk1ueOeYcdU1VzZnapX2u9vahpY5Gj33Qk3HxX1XacmAgReaxlWeCjzFg_58CarFNDWrprxbbFFCVbcui9pHIuHXbKWg3Pi39sEqza3h0GFQ0DieD1gU0SVnvnpL_AebdtXU |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_1016_j_cor_2012_06_003 crossref_primary_10_1007_s10951_018_0568_y crossref_primary_10_1016_j_cor_2014_06_002 crossref_primary_10_1007_s10951_016_0506_9 crossref_primary_10_2139_ssrn_4007741 crossref_primary_10_1007_s10951_017_0552_y crossref_primary_10_1142_S0217595910002831 crossref_primary_10_1016_j_dam_2024_06_031 crossref_primary_10_1016_j_dam_2016_08_021 crossref_primary_10_1016_j_ejor_2025_01_034 crossref_primary_10_1016_j_ejor_2014_09_043 crossref_primary_10_1016_j_omega_2015_09_010 crossref_primary_10_1142_S0217595915500475 crossref_primary_10_1016_j_ejor_2010_09_042 crossref_primary_10_1016_j_cor_2024_106542 crossref_primary_10_1080_01605682_2019_1700179 crossref_primary_10_1134_S1064226921130064 crossref_primary_10_1080_0305215X_2015_1120298 crossref_primary_10_1134_S1064226922120130 crossref_primary_10_1016_j_tcs_2014_07_017 crossref_primary_10_1016_j_cor_2018_05_025 crossref_primary_10_1080_24725854_2018_1479899 crossref_primary_10_1007_s10951_011_0230_4 crossref_primary_10_1016_j_jnca_2018_03_033 crossref_primary_10_26634_jse_11_3_13633 crossref_primary_10_1016_j_cor_2014_02_001 crossref_primary_10_1080_00207540701499499 crossref_primary_10_1016_j_cor_2011_03_001 crossref_primary_10_1080_0305215X_2018_1458844 crossref_primary_10_17065_huniibf_259136 crossref_primary_10_1016_j_trpro_2017_03_029 crossref_primary_10_1080_23302674_2022_2141590 crossref_primary_10_1016_j_ejor_2022_06_050 crossref_primary_10_1080_00207543_2016_1192695 crossref_primary_10_1016_j_jcss_2024_103533 crossref_primary_10_1016_j_ijpe_2011_03_018 crossref_primary_10_1287_msom_2023_1188 crossref_primary_10_1016_j_ejor_2024_11_044 crossref_primary_10_1080_0305215X_2012_743532 crossref_primary_10_1016_j_ejor_2007_04_040 crossref_primary_10_1016_j_ejor_2023_05_039 crossref_primary_10_1007_s40819_016_0216_1 crossref_primary_10_1016_j_cie_2015_12_021 crossref_primary_10_3182_20110828_6_IT_1002_00847 crossref_primary_10_1016_j_artint_2014_04_001 crossref_primary_10_1016_j_ejor_2015_12_044 crossref_primary_10_1016_j_ejor_2022_02_046 crossref_primary_10_1007_s10479_009_0624_2 crossref_primary_10_1007_s10951_019_00617_7 crossref_primary_10_3846_1392_8619_2009_15_245_266 crossref_primary_10_1016_j_ijpe_2008_10_005 crossref_primary_10_1007_s00453_016_0148_5 crossref_primary_10_1016_j_cor_2022_106056 crossref_primary_10_1080_15472450_2013_836930 crossref_primary_10_1007_s10951_014_0411_z crossref_primary_10_1016_j_ejor_2022_11_014 crossref_primary_10_1080_00207540701666204 crossref_primary_10_1007_s10107_021_01624_3 crossref_primary_10_1007_s10287_016_0262_5 crossref_primary_10_1007_s10951_010_0204_y crossref_primary_10_1177_0142331211402897 crossref_primary_10_1002_cpe_3176 crossref_primary_10_1080_00207540903289771 crossref_primary_10_35272_jaet_2015_8_1_45 crossref_primary_10_1016_j_ijpe_2007_06_004 crossref_primary_10_2139_ssrn_3477339 crossref_primary_10_1016_j_tcs_2010_05_011 crossref_primary_10_1002_net_21973 crossref_primary_10_1080_0740817X_2015_1078016 crossref_primary_10_1016_j_trpro_2016_12_084 crossref_primary_10_1016_j_dss_2020_113343 crossref_primary_10_1007_s10586_018_02892_z crossref_primary_10_1109_ACCESS_2018_2861462 crossref_primary_10_1016_j_ijpe_2017_05_014 crossref_primary_10_1016_j_tcs_2014_10_033 crossref_primary_10_3846_1392_8619_2009_15_189_196 crossref_primary_10_1016_j_ejco_2021_100010 crossref_primary_10_1080_00207543_2015_1037023 crossref_primary_10_1287_isre_2022_0243 crossref_primary_10_1007_s10586_009_0100_4 crossref_primary_10_1007_s10951_024_00812_1 crossref_primary_10_1007_s11590_017_1191_0 crossref_primary_10_1016_j_tcs_2019_10_046 crossref_primary_10_1007_s10878_009_9270_5 crossref_primary_10_1016_j_ifacol_2015_06_183 crossref_primary_10_1057_jors_2013_109 crossref_primary_10_1016_j_ejor_2011_07_053 crossref_primary_10_1007_s10951_017_0511_7 crossref_primary_10_1007_s11766_015_3076_2 crossref_primary_10_24988_ije_202136211 crossref_primary_10_1016_j_tcs_2011_03_025 crossref_primary_10_1109_ACCESS_2024_3462765 crossref_primary_10_1007_s11227_013_0974_z crossref_primary_10_1007_s10898_020_00880_5 crossref_primary_10_1016_j_ejor_2012_06_035 crossref_primary_10_1016_j_ejor_2011_10_019 crossref_primary_10_51551_verimlilik_1521438 crossref_primary_10_1016_j_tcs_2010_04_042 crossref_primary_10_1016_j_ijpe_2010_02_009 |
| Cites_doi | 10.1016/0304-3975(94)90150-3 10.1007/BF02579273 10.1287/opre.45.4.624 10.1145/502102.502107 10.1137/S0097539795283292 10.1016/0020-0190(87)90107-4 10.1016/S0305-0548(98)00051-3 10.1007/3-540-54945-5_43 10.1016/0166-218X(87)90037-0 10.1016/0167-6377(92)90087-J 10.1016/0095-8956(80)90079-9 10.1007/3-540-45061-0_59 10.1287/opre.40.1.S96 10.1016/0925-5273(91)90049-Y 10.1145/2786.2793 10.1007/s004530010074 10.1002/nav.3800010309 10.1007/BF02592148 10.1016/0166-218X(86)90056-9 10.1016/0166-218X(92)00036-L 10.1145/800158.805069 10.1007/BF01580222 10.1023/A:1008297330705 10.1287/opre.26.1.68 10.1109/MASS.1993.289755 10.1137/0205048 10.1016/S0305-0548(00)00086-1 10.1007/978-3-540-39658-1_53 10.4153/CJM-1965-053-6 10.1137/S0097539799354138 10.1016/0377-2217(91)90320-U 10.1007/3-540-46004-7_12 10.1080/00207169608804486 10.1287/moor.22.3.754 10.1007/BF01294260 10.1023/A:1008369322970 10.1007/BF02243394 10.1007/3-540-45061-0_86 10.1016/S0304-3975(02)00086-5 10.1287/opre.40.1.S28 10.1007/3-540-40996-3_20 10.1016/0166-218X(95)00112-5 10.1016/0377-2217(86)90016-0 10.1006/jagm.1998.1001 10.1007/BF02238071 10.1007/s00493-005-0012-8 10.1007/BF01580444 10.1016/S0167-6377(98)00019-4 10.1016/0166-218X(93)E0174-W 10.1016/S0020-0190(97)00044-6 10.1016/S0020-0190(98)00177-X 10.1016/0377-2217(95)00010-N 10.1016/S0196-6774(02)00291-2 10.1016/0020-0190(92)90216-I 10.1002/nav.10044 10.1023/B:TIME.0000045315.61234.1e 10.1016/j.orl.2004.02.005 10.1080/07408170208928886 10.1137/0601025 10.1007/BF02579139 10.1016/0305-0548(92)90067-F 10.1080/00207160310001614972 10.1080/002075498193192 10.1109/TC.2004.1255792 10.1023/A:1022985808959 10.4007/annals.2006.164.51 10.1002/(SICI)1099-1425(199909/10)2:5<215::AID-JOS27>3.0.CO;2-Y 10.1109/TC.1979.1675260 10.1016/S0166-218X(02)00289-5 10.1016/S0020-0190(00)00025-9 10.1016/S0305-0548(02)00084-9 10.1007/PL00009192 10.1007/s10107-003-0449-8 10.1007/BF02614319 10.1007/PL00009286 10.1007/BF02283692 10.1287/opre.40.1.S76 10.1007/BF01185340 10.1287/moor.12.3.522 10.1007/3-540-36605-9_22 10.1007/s10107-002-0335-9 10.1016/S0305-0548(98)00090-2 10.1007/BF00121680 10.1023/B:JOSH.0000031423.39762.d3 |
| ContentType | Journal Article |
| Copyright | 2006 Elsevier B.V. 2007 INIST-CNRS Copyright Elsevier Sequoia S.A. Apr 16, 2007 |
| Copyright_xml | – notice: 2006 Elsevier B.V. – notice: 2007 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Apr 16, 2007 |
| DBID | AAYXX CITATION IQODW DKI X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| DOI | 10.1016/j.ejor.2006.01.049 |
| DatabaseName | CrossRef Pascal-Francis RePEc IDEAS RePEc Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: DKI name: RePEc IDEAS url: http://ideas.repec.org/ sourceTypes: Index Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business Applied Sciences |
| EISSN | 1872-6860 |
| EndPage | 342 |
| ExternalDocumentID | 1247685181 eeeejores_v_3a178_3ay_3a2007_3ai_3a2_3ap_3a331_342_htm 18402076 10_1016_j_ejor_2006_01_049 S0377221706003559 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 02 08R 0R 1 41 6XO 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K M MS PQEST STF X X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c479t-69d76d4077aed7bb4e76db2cf67f987e7e1be310a940973f49360f5a8246d5ae3 |
| IEDL.DBID | AIKHN |
| ISSN | 0377-2217 |
| IngestDate | Fri Jul 25 03:38:18 EDT 2025 Wed Aug 18 03:50:57 EDT 2021 Mon Jul 21 09:13:13 EDT 2025 Wed Oct 01 00:55:36 EDT 2025 Thu Apr 24 23:00:08 EDT 2025 Fri Feb 23 02:27:51 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Interval graph Maximum weight independent set Discrete starting times Maximum weight clique Interval scheduling k-track assignment k-coloring Resource allocation Transmission channel Unloading Printed circuit board Scheduling Graph theory Bandwidth allocation Computational complexity Wiring Interconnection Algorithm complexity Discrete time Channel allocation Independent set Planning Work planning |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c479t-69d76d4077aed7bb4e76db2cf67f987e7e1be310a940973f49360f5a8246d5ae3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 204140005 |
| PQPubID | 45678 |
| PageCount | 12 |
| ParticipantIDs | proquest_journals_204140005 repec_primary_eeeejores_v_3a178_3ay_3a2007_3ai_3a2_3ap_3a331_342_htm pascalfrancis_primary_18402076 crossref_primary_10_1016_j_ejor_2006_01_049 crossref_citationtrail_10_1016_j_ejor_2006_01_049 elsevier_sciencedirect_doi_10_1016_j_ejor_2006_01_049 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2007-04-16 |
| PublicationDateYYYYMMDD | 2007-04-16 |
| PublicationDate_xml | – month: 04 year: 2007 text: 2007-04-16 day: 16 |
| PublicationDecade | 2000 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationSeriesTitle | European Journal of Operational Research |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2007 |
| Publisher | Elsevier B.V Elsevier Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A |
| References | Bouzina, Emmons (bib15) 1996; 9 Grötschel, Lovász, Schrijver (bib49) 1981; 1 Battiti, Protasi (bib7) 2001; 29 Grötschel, Lovász, Schrijver (bib48) 1993 Hiraishi, Levner, Vlach (bib55) 2002; 29 Bomze (bib12) 1998; 13 Shor (bib87) 1970; 2 Harms (bib52) 1998; 68 Chudnovsky, Robertson, Seymour, Thomas (bib28) 2003; 97 Erlebach, Spieksma (bib33) 2001; 1969 Frank (bib40) 1980; 29 Faigle, Nawijn (bib36) 1995; 58 Lee, Sarrafzadeh (bib67) 1991; 557 Motzkin, Straus (bib74) 1965; 17 Dijkstra, Kroon, van Nunen, Salomon (bib30) 1991; 23 Lann, Mosheiov (bib65) 2003; 30 Torng (bib92) 1998; 20 Marchiori (bib71) 2002; 2279 Locatelli, Bomze, Pelillo (bib69) 2004; 32 D. Long, M. Thakur, Scheduling real-time disk transfers for continuous media applications, in: 12th IEEE Symposium on Mass Storage Systems, 1993, pp. 227–232. N.Z. Shor, Dual quadratic estimates in polynomial and Boolean programming, in: P.M. Pardalos, J.B. Rosen (Eds.), Computational Methods of Global Optimization, Annals of Operations Research, vol. 25, 1990, pp. 163–168. Brucker, Nordmann (bib18) 1994; 52 Chen, Jiang, Lin, Wen, Xu, Xu, Xu (bib24) 2003; 299 Martello, Toth (bib72) 1986; 24 Arkin, Silverberg (bib2) 1987; 18 Erlebach, Spieksma (bib34) 2003; 46 (bib58) 1996; vol. 26 Naor, Shachnai, Tamir (bib75) 2003; 2719 Ben-David, Borodin, Karp, Tardos, Wigderson (bib10) 1994; 11 A.J.W. Kolen, J.K. Lenstra, Combinatorics in operations research, in: R. Graham et al. (Eds.), Handbooks of Combinatorics, vol. II. 1995, pp. 1901–1904. Fischetti, Martello, Toth (bib39) 1992; 40 Gupta, Lee, Leung (bib51) 1979; 28 Keil (bib59) 1992; 12 Sleator, Tarjan (bib89) 1970; 28 Faigle, Kern, Nawijn (bib35) 1999; 31 Bar-Noy, Bar-Yehuda, Freund, Naor, Schieber (bib8) 2001; 31 C.T. Ng, M.Y. Kovalyov, T.C.E. Cheng, A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines, submitted for publication. Saha, Pal (bib82) 2003; 80 Lipton, Tomkins (bib68) 1994 Bomze, Budinich, Pardalos, Pelillo (bib13) 1999 Babel (bib3) 1994; 52 Bach, Boyar, Epstein, Favrholdt, Jiang, Larsen, Lin, van Stee (bib4) 2003; 6 Schrijver (bib84) 1986; 14 Kroon, Salomon, van Wassenhove (bib64) 1997; 45 Gibbons, Hearn, Pardalos, Ramana (bib46) 1997; 22 A. Hashimoto, J. Stevens, Wire routing by optimizing channel assignment with large apertures, in: Proceedings of the 8th Design Automation Conference, 1971, pp. 155–169. Carter, Tovey (bib21) 1992; 40 Miyazawa, Erlebach (bib73) 2004; 7 Pal, Bhattacharjee (bib79) 1996; 60 Chen, Jiang, Lin, Rizzi, Wen, Xu, Xu (bib23) 2003; 2832 Garey, Johnson, Miller (bib43) 1980; 1 Sivrikaya-Serifoglu, Ulusoy (bib90) 1999; 26 Bomze (bib14) 1997; 11 Khachiyan (bib60) 1979; 244 Boyar, Larsen (bib16) 1999; 25 Canetti, Irani (bib19) 1998; 27 Gavril (bib44) 2000; 73 Lawler (bib66) 1976 Woeginger (bib95) 1994; 130 Fenet, Solnon (bib38) 2003; 2611 Nemhauser, Trotter (bib76) 1974; 6 Carlisle, Lloyd (bib20) 1995; 59 Sarrafzadeh, Lou (bib83) 1993; 9 Bhatia, Chuzhoy, Freund, Naor (bib11) 2003; 2719 Hsiao, Tang, Chang (bib56) 1992; 43 Veeramachaneni, Berman, Miller (bib93) 2003; 127 Pardalos, Rodgers (bib80) 1992; 19 Chudnovsky, Cornuéjols, Liu, Seymour, Vušković (bib26) 2005; 25 Even, Itai, Shamir (bib32) 1976; 5 Gabrel (bib42) 1995; 83 Balas, Chvátal, Nešetril (bib6) 1987; 12 Dantzig, Fulkerson (bib29) 1954; 1 Spieksma (bib91) 1999; 2 Dondeti, Emmons (bib31) 1992; 40 Ahuja, Magnanti, Orlin (bib1) 1993 Fujisawa, Kojima, Nakata (bib41) 1997; 79 Balakrishnan, Kanet, Sridharan (bib5) 1999; 26 Chmeiss, Jégou (bib25) 1997; 62 Faneyte, Spieksma, Woeginger (bib37) 2002; 49 Chudnovsky, Robertson, Seymour, Thomas (bib27) 2006; 164 Sha, Abdelzaher, Arzen, Cervin, Baker, Burns, Buttazzo, Caccamo, Lehoczky, Mok (bib86) 2004; 28 Vavasis, Ye (bib81) 1996; 74 W.L. Hsu, K.H. Tsai, A linear time algorithm for the two-track assignment problem, in: Proceedings of 27th Allerton Conference on Communication, Control and Computing, 1989, pp. 291–300. Seiden (bib85) 1998; 220 Yannakakis, Gavril (bib96) 1987; 24 Korst, Aarts, Lenstra, Wessels (bib63) 1994; 51 Gertsbakh, Stern (bib45) 1978; 18 Heady, Zhu (bib54) 1998; 36 Golumbic (bib47) 1980 Nemhauser, Trotter (bib77) 1975; 8 Waterer, Johnson, Nobili, Savelsbergh (bib94) 2002; 93 Brehob, Wagner, Torng, Enbody (bib17) 2004; 53 Kolen, Kroon (bib61) 1991; 54 Grötschel, Lovász, Schrijver (bib50) 1984; 4 Bar-Noy, Guha, Naor, Schieber (bib9) 2001; 48 Chen, Hassin, Tzur (bib22) 2002; 34 Bach (10.1016/j.ejor.2006.01.049_bib4) 2003; 6 Naor (10.1016/j.ejor.2006.01.049_bib75) 2003; 2719 Kroon (10.1016/j.ejor.2006.01.049_bib64) 1997; 45 Torng (10.1016/j.ejor.2006.01.049_bib92) 1998; 20 Faigle (10.1016/j.ejor.2006.01.049_bib36) 1995; 58 Battiti (10.1016/j.ejor.2006.01.049_bib7) 2001; 29 Brehob (10.1016/j.ejor.2006.01.049_bib17) 2004; 53 Vavasis (10.1016/j.ejor.2006.01.049_bib81) 1996; 74 Marchiori (10.1016/j.ejor.2006.01.049_bib71) 2002; 2279 Faneyte (10.1016/j.ejor.2006.01.049_bib37) 2002; 49 Hsiao (10.1016/j.ejor.2006.01.049_bib56) 1992; 43 Harms (10.1016/j.ejor.2006.01.049_bib52) 1998; 68 Chen (10.1016/j.ejor.2006.01.049_bib22) 2002; 34 Dijkstra (10.1016/j.ejor.2006.01.049_bib30) 1991; 23 Chudnovsky (10.1016/j.ejor.2006.01.049_bib27) 2006; 164 Gabrel (10.1016/j.ejor.2006.01.049_bib42) 1995; 83 10.1016/j.ejor.2006.01.049_bib70 Frank (10.1016/j.ejor.2006.01.049_bib40) 1980; 29 Babel (10.1016/j.ejor.2006.01.049_bib3) 1994; 52 Bhatia (10.1016/j.ejor.2006.01.049_bib11) 2003; 2719 Sarrafzadeh (10.1016/j.ejor.2006.01.049_bib83) 1993; 9 (10.1016/j.ejor.2006.01.049_bib58) 1996; vol. 26 Keil (10.1016/j.ejor.2006.01.049_bib59) 1992; 12 Chudnovsky (10.1016/j.ejor.2006.01.049_bib26) 2005; 25 10.1016/j.ejor.2006.01.049_bib78 Bouzina (10.1016/j.ejor.2006.01.049_bib15) 1996; 9 Nemhauser (10.1016/j.ejor.2006.01.049_bib76) 1974; 6 Carlisle (10.1016/j.ejor.2006.01.049_bib20) 1995; 59 Hiraishi (10.1016/j.ejor.2006.01.049_bib55) 2002; 29 Grötschel (10.1016/j.ejor.2006.01.049_bib50) 1984; 4 Lawler (10.1016/j.ejor.2006.01.049_bib66) 1976 Sleator (10.1016/j.ejor.2006.01.049_bib89) 1970; 28 Grötschel (10.1016/j.ejor.2006.01.049_bib49) 1981; 1 Waterer (10.1016/j.ejor.2006.01.049_bib94) 2002; 93 Golumbic (10.1016/j.ejor.2006.01.049_bib47) 1980 Gibbons (10.1016/j.ejor.2006.01.049_bib46) 1997; 22 Even (10.1016/j.ejor.2006.01.049_bib32) 1976; 5 Bomze (10.1016/j.ejor.2006.01.049_bib14) 1997; 11 Gavril (10.1016/j.ejor.2006.01.049_bib44) 2000; 73 Shor (10.1016/j.ejor.2006.01.049_bib87) 1970; 2 Bomze (10.1016/j.ejor.2006.01.049_bib13) 1999 Balakrishnan (10.1016/j.ejor.2006.01.049_bib5) 1999; 26 Saha (10.1016/j.ejor.2006.01.049_bib82) 2003; 80 Arkin (10.1016/j.ejor.2006.01.049_bib2) 1987; 18 Chen (10.1016/j.ejor.2006.01.049_bib23) 2003; 2832 Grötschel (10.1016/j.ejor.2006.01.049_bib48) 1993 Miyazawa (10.1016/j.ejor.2006.01.049_bib73) 2004; 7 Martello (10.1016/j.ejor.2006.01.049_bib72) 1986; 24 10.1016/j.ejor.2006.01.049_bib88 Locatelli (10.1016/j.ejor.2006.01.049_bib69) 2004; 32 Seiden (10.1016/j.ejor.2006.01.049_bib85) 1998; 220 Sivrikaya-Serifoglu (10.1016/j.ejor.2006.01.049_bib90) 1999; 26 Yannakakis (10.1016/j.ejor.2006.01.049_bib96) 1987; 24 Canetti (10.1016/j.ejor.2006.01.049_bib19) 1998; 27 Chudnovsky (10.1016/j.ejor.2006.01.049_bib28) 2003; 97 Carter (10.1016/j.ejor.2006.01.049_bib21) 1992; 40 Heady (10.1016/j.ejor.2006.01.049_bib54) 1998; 36 Bar-Noy (10.1016/j.ejor.2006.01.049_bib9) 2001; 48 Kolen (10.1016/j.ejor.2006.01.049_bib61) 1991; 54 Sha (10.1016/j.ejor.2006.01.049_bib86) 2004; 28 Balas (10.1016/j.ejor.2006.01.049_bib6) 1987; 12 Spieksma (10.1016/j.ejor.2006.01.049_bib91) 1999; 2 Veeramachaneni (10.1016/j.ejor.2006.01.049_bib93) 2003; 127 Chmeiss (10.1016/j.ejor.2006.01.049_bib25) 1997; 62 Erlebach (10.1016/j.ejor.2006.01.049_bib33) 2001; 1969 10.1016/j.ejor.2006.01.049_bib53 Lee (10.1016/j.ejor.2006.01.049_bib67) 1991; 557 Schrijver (10.1016/j.ejor.2006.01.049_bib84) 1986; 14 Erlebach (10.1016/j.ejor.2006.01.049_bib34) 2003; 46 Pardalos (10.1016/j.ejor.2006.01.049_bib80) 1992; 19 Dondeti (10.1016/j.ejor.2006.01.049_bib31) 1992; 40 Fenet (10.1016/j.ejor.2006.01.049_bib38) 2003; 2611 Pal (10.1016/j.ejor.2006.01.049_bib79) 1996; 60 Brucker (10.1016/j.ejor.2006.01.049_bib18) 1994; 52 Faigle (10.1016/j.ejor.2006.01.049_bib35) 1999; 31 Fischetti (10.1016/j.ejor.2006.01.049_bib39) 1992; 40 10.1016/j.ejor.2006.01.049_bib57 Ahuja (10.1016/j.ejor.2006.01.049_bib1) 1993 Lipton (10.1016/j.ejor.2006.01.049_bib68) 1994 Woeginger (10.1016/j.ejor.2006.01.049_bib95) 1994; 130 Chen (10.1016/j.ejor.2006.01.049_bib24) 2003; 299 Gupta (10.1016/j.ejor.2006.01.049_bib51) 1979; 28 Korst (10.1016/j.ejor.2006.01.049_bib63) 1994; 51 Khachiyan (10.1016/j.ejor.2006.01.049_bib60) 1979; 244 Garey (10.1016/j.ejor.2006.01.049_bib43) 1980; 1 10.1016/j.ejor.2006.01.049_bib62 Fujisawa (10.1016/j.ejor.2006.01.049_bib41) 1997; 79 Bomze (10.1016/j.ejor.2006.01.049_bib12) 1998; 13 Boyar (10.1016/j.ejor.2006.01.049_bib16) 1999; 25 Dantzig (10.1016/j.ejor.2006.01.049_bib29) 1954; 1 Lann (10.1016/j.ejor.2006.01.049_bib65) 2003; 30 Nemhauser (10.1016/j.ejor.2006.01.049_bib77) 1975; 8 Bar-Noy (10.1016/j.ejor.2006.01.049_bib8) 2001; 31 Ben-David (10.1016/j.ejor.2006.01.049_bib10) 1994; 11 Motzkin (10.1016/j.ejor.2006.01.049_bib74) 1965; 17 Gertsbakh (10.1016/j.ejor.2006.01.049_bib45) 1978; 18 |
| References_xml | – year: 1993 ident: bib1 article-title: Network Flows—Theory, Algorithms, and Applications – volume: 26 start-page: 773 year: 1999 end-page: 787 ident: bib90 article-title: Parallel machine scheduling with earliness and tardiness penalties publication-title: Computers and Operations Research – volume: 52 start-page: 97 year: 1994 end-page: 122 ident: bib18 article-title: The publication-title: Computing – volume: 1969 start-page: 228 year: 2001 end-page: 240 ident: bib33 article-title: Simple algorithms for a weighted interval selection problem publication-title: Lecture Notes in Computer Science – volume: 68 start-page: 291 year: 1998 end-page: 293 ident: bib52 article-title: A simple optimal algorithm for scheduling variable-sized requests publication-title: Information Processing Letters – reference: C.T. Ng, M.Y. Kovalyov, T.C.E. Cheng, A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines, submitted for publication. – volume: 40 start-page: 28 year: 1992 end-page: 39 ident: bib21 article-title: When is the classroom assignment problem hard? publication-title: Operations Research – volume: 29 start-page: 176 year: 1980 end-page: 184 ident: bib40 article-title: On chain and antichain families of a partially ordered set publication-title: Journal of Combinatorial Theory Series B – volume: 1 start-page: 216 year: 1980 end-page: 227 ident: bib43 article-title: Papadimitriou, The complexity of coloring circular arcs and hords publication-title: SIAM Journal on Algebraic Discrete Methods – volume: 51 start-page: 291 year: 1994 end-page: 305 ident: bib63 article-title: Periodic assignment and graph colouring publication-title: Discrete Applied Mathematics – volume: 74 start-page: 79 year: 1996 end-page: 120 ident: bib81 article-title: A primal–dual interior point method whose running time depends only on the constraint matrix publication-title: Mathematical Programming – volume: 30 start-page: 1745 year: 2003 end-page: 1749 ident: bib65 article-title: A note on the maximum number of on-time jobs on parallel identical machines publication-title: Computers and Operations Research – start-page: 302 year: 1994 end-page: 311 ident: bib68 article-title: Online interval scheduling publication-title: Proceedings of 5th Annual ACM-SIAM Symposium on Discrete Algorithms – volume: 45 start-page: 624 year: 1997 end-page: 638 ident: bib64 article-title: Exact and approximation algorithms for the tactical fixed interval scheduling problem publication-title: Operations Research – volume: 127 start-page: 119 year: 2003 end-page: 143 ident: bib93 article-title: Aligning two fragmented sequences publication-title: Discrete Applied Mathematics – volume: 49 start-page: 743 year: 2002 end-page: 759 ident: bib37 article-title: A branch-and-price algorithm for a hierarchical crew scheduling problem publication-title: Naval Research Logistics – volume: 25 start-page: 403 year: 1999 end-page: 417 ident: bib16 article-title: The seat reservation problem publication-title: Algorithmica – volume: 31 start-page: 331 year: 2001 end-page: 352 ident: bib8 article-title: Approximating the throughput of multiple machines in real-time scheduling publication-title: SIAM Journal on Computing – volume: 29 start-page: 841 year: 2002 end-page: 848 ident: bib55 article-title: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs publication-title: Computers and Operations Research – volume: 32 start-page: 523 year: 2004 end-page: 529 ident: bib69 article-title: The combinatorics of pivoting for the maximum weight clique publication-title: Operations Research Letters – volume: 24 start-page: 106 year: 1986 end-page: 117 ident: bib72 article-title: A heuristic approach to the bus driver scheduling problem publication-title: European Journal of Operational Research – volume: 557 start-page: 2 year: 1991 end-page: 11 ident: bib67 article-title: Maximum independent set of a permutation graph in publication-title: Lecture Notes in Computer Science – volume: 29 start-page: 610 year: 2001 end-page: 637 ident: bib7 article-title: Reactive local search for the maximum clique problem publication-title: Algorithmica – year: 1980 ident: bib47 article-title: Algorithmic Graph Theory and Perfect Graphs – volume: 43 start-page: 229 year: 1992 end-page: 235 ident: bib56 article-title: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs publication-title: Information Processing Letters – volume: 6 start-page: 48 year: 1974 end-page: 61 ident: bib76 article-title: Properties of vertex packings and independence system polyhedra publication-title: Mathematical Programming – volume: 46 start-page: 27 year: 2003 end-page: 53 ident: bib34 article-title: Interval selection: Applications, algorithms, and lower bounds publication-title: Journal of Algorithms – volume: 52 start-page: 31 year: 1994 end-page: 38 ident: bib3 article-title: A fast algorithm for the maximum weight clique problem publication-title: Computing – volume: 1 start-page: 217 year: 1954 end-page: 222 ident: bib29 article-title: Minimizing the number of tankers to meet a fixed schedule publication-title: Naval Research Logistics Quarterly – volume: 5 start-page: 691 year: 1976 end-page: 703 ident: bib32 article-title: On the complexity of timetable and multicommodity flow problems publication-title: SIAM Journal on Computing – volume: 31 start-page: 196 year: 1999 end-page: 210 ident: bib35 article-title: A greedy on-line algorithm for the publication-title: Journal of Algorithms – volume: 2611 start-page: 236 year: 2003 end-page: 245 ident: bib38 article-title: Searching for maximum cliques with ant colony optimization publication-title: Lecture Notes in Computer Science – volume: 22 start-page: 754 year: 1997 end-page: 768 ident: bib46 article-title: Continuous characterizations of the maximum clique problem publication-title: Mathematics of Operations Research – start-page: 1 year: 1999 end-page: 74 ident: bib13 article-title: The maximum clique problem publication-title: Handbook of Combinatorial Optimization – volume: 48 start-page: 1069 year: 2001 end-page: 1090 ident: bib9 article-title: A unified approach to approximating resource allocation and scheduling publication-title: Journal of the ACM – volume: 18 start-page: 68 year: 1978 end-page: 95 ident: bib45 article-title: Minimal resources for fixed and variable job schedules publication-title: Operations Research – volume: 36 start-page: 1619 year: 1998 end-page: 1632 ident: bib54 article-title: Minimizing the sum of job earliness and tardiness in a multi-machine system publication-title: International Journal of Production Research – volume: 19 start-page: 363 year: 1992 end-page: 375 ident: bib80 article-title: A branch and bound algorithm for the maximum clique problem publication-title: Computers and Operations Research – reference: A. Hashimoto, J. Stevens, Wire routing by optimizing channel assignment with large apertures, in: Proceedings of the 8th Design Automation Conference, 1971, pp. 155–169. – volume: 80 start-page: 1477 year: 2003 end-page: 1487 ident: bib82 article-title: Maximum weight publication-title: International Journal of Computer Mathematics – volume: 23 start-page: 69 year: 1991 end-page: 78 ident: bib30 article-title: A DSS for capacity planning of aircraft maintenance personnel publication-title: International Journal of Production Research – volume: 14 start-page: 111 year: 1986 end-page: 133 ident: bib84 article-title: Polyhedral proof methods in combinatorial optimization publication-title: Discrete Applied Mathematics – volume: 299 start-page: 211 year: 2003 end-page: 229 ident: bib24 article-title: Approximation algorithms for NMR spectral peak assignment publication-title: Theoretical Computer Science – volume: 40 start-page: S96 year: 1992 end-page: S108 ident: bib39 article-title: Approximation algorithms for fixed job schedule problems publication-title: Operations Research – volume: 12 start-page: 522 year: 1987 end-page: 535 ident: bib6 article-title: On the maximum weight clique problem publication-title: Mathematics of Operations Research – volume: 164 start-page: 51 year: 2006 end-page: 229 ident: bib27 article-title: The strong perfect graph theorem publication-title: Annals of Mathematics – volume: 4 start-page: 291 year: 1984 end-page: 295 ident: bib50 article-title: Corrigendum to our paper, The ellipsoid method and its consequences in combinatorial optimization publication-title: Combinatorica – volume: 244 start-page: 1093 year: 1979 end-page: 1096 ident: bib60 article-title: A polynomial algorithm in linear programming publication-title: Dokladi Akademii Nauk SSSR – volume: 20 start-page: 175 year: 1998 end-page: 200 ident: bib92 article-title: A unified analysis of paging and caching publication-title: Algorithmica – volume: 79 start-page: 235 year: 1997 end-page: 253 ident: bib41 article-title: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming publication-title: Mathematical Programming – volume: 13 start-page: 369 year: 1998 end-page: 387 ident: bib12 article-title: On standard quadratic optimization problem publication-title: Journal of Global Optimization – volume: 2719 start-page: 751 year: 2003 end-page: 766 ident: bib11 article-title: Algorithmic aspects of bandwidth trading publication-title: Lecture Notes in Computer Science – volume: 59 start-page: 225 year: 1995 end-page: 235 ident: bib20 article-title: On the publication-title: Discrete Applied Mathematics – volume: 2719 start-page: 1123 year: 2003 end-page: 1137 ident: bib75 article-title: Real-time scheduling with a budget publication-title: Lecture Notes in Computer Science – volume: 27 start-page: 993 year: 1998 end-page: 1015 ident: bib19 article-title: Bounding the power of preemption in randomized scheduling publication-title: SIAM Journal on Computing – volume: 53 start-page: 73 year: 2004 end-page: 76 ident: bib17 article-title: Optimal replacement is NP-hard for nonstandard caches publication-title: IEEE Transactions on Computers – volume: 25 start-page: 143 year: 2005 end-page: 187 ident: bib26 article-title: Recognizing Berge graphs publication-title: Combinatorica – volume: 7 start-page: 293 year: 2004 end-page: 311 ident: bib73 article-title: An improved randomized on-line algorithm for a weighted interval selection problem publication-title: Journal of Scheduling – year: 1993 ident: bib48 article-title: Geometric Algorithms and Combinatorial Optimization – volume: 11 start-page: 2 year: 1994 end-page: 14 ident: bib10 article-title: On the power of randomization in on-line algorithms publication-title: Algorithmica – volume: 83 start-page: 320 year: 1995 end-page: 329 ident: bib42 article-title: Scheduling jobs within time windows on identical parallel machines: New model and algorithms publication-title: European Journal of Operational Research – volume: 60 start-page: 205 year: 1996 end-page: 214 ident: bib79 article-title: A sequential algorithm for finding a maximum weight publication-title: International Journal of Computer Mathematics – volume: 17 start-page: 533 year: 1965 end-page: 540 ident: bib74 article-title: Maxima for graphs and a new proof of a theorem of Turán publication-title: Canadian Journal of Mathematics – reference: N.Z. Shor, Dual quadratic estimates in polynomial and Boolean programming, in: P.M. Pardalos, J.B. Rosen (Eds.), Computational Methods of Global Optimization, Annals of Operations Research, vol. 25, 1990, pp. 163–168. – volume: 18 start-page: 1 year: 1987 end-page: 8 ident: bib2 article-title: Scheduling jobs with fixed start and finish times publication-title: Discrete Applied Mathematics – volume: 9 start-page: 84 year: 1993 end-page: 100 ident: bib83 article-title: Maximum publication-title: Algorithmica – volume: 220 start-page: 171 year: 1998 end-page: 177 ident: bib85 article-title: Randomized online interval scheduling publication-title: Operations Research Letters – volume: 93 start-page: 477 year: 2002 end-page: 494 ident: bib94 article-title: The relation of time indexed formulations of single machine scheduling problems to the node packing problem publication-title: Mathematical Programming Series A – volume: 24 start-page: 133 year: 1987 end-page: 137 ident: bib96 article-title: The maximum publication-title: Information Processing Letters – volume: 6 start-page: 131 year: 2003 end-page: 147 ident: bib4 article-title: Tight bounds on the competitive ratio on accomodating sequences for the seat reservation problem publication-title: Journal of Scheduling – volume: 11 start-page: 325 year: 1997 end-page: 338 ident: bib14 article-title: Global escape strategies for maximizing quadratic forms over a simplex publication-title: Journal of Global Optimization – reference: W.L. Hsu, K.H. Tsai, A linear time algorithm for the two-track assignment problem, in: Proceedings of 27th Allerton Conference on Communication, Control and Computing, 1989, pp. 291–300. – volume: 2279 start-page: 112 year: 2002 end-page: 121 ident: bib71 article-title: Genetic, iterated and multistart local search for the maximum clique problem publication-title: Lecture Notes in Computer Science – volume: 73 start-page: 181 year: 2000 end-page: 188 ident: bib44 article-title: Maximum weight independent sets and cliques in intersection graphs of filaments publication-title: Information Processing Letters – volume: 12 start-page: 293 year: 1992 end-page: 295 ident: bib59 article-title: On the complexity of scheduling tasks with discrete starting times publication-title: Operations Research Letters – volume: 34 start-page: 501 year: 2002 end-page: 507 ident: bib22 article-title: Allocation of bandwidth and storage publication-title: IIE Transactions – volume: 40 start-page: S76 year: 1992 end-page: S85 ident: bib31 article-title: Fixed job scheduling with two types of processors publication-title: Operations Research – volume: 54 start-page: 23 year: 1991 end-page: 28 ident: bib61 article-title: On the computational complexity of (maximum) class scheduling publication-title: European Journal of Operational Research – volume: 62 start-page: 61 year: 1997 end-page: 66 ident: bib25 article-title: A generalization of chordal graphs and the maximum clique problem publication-title: Information Processing Letters – volume: 9 start-page: 379 year: 1996 end-page: 393 ident: bib15 article-title: Interval scheduling on identical machines publication-title: Journal of Global Optimization – volume: 97 start-page: 405 year: 2003 end-page: 422 ident: bib28 article-title: Progress on perfect graphs publication-title: Mathematical Programming Series B – volume: 26 start-page: 127 year: 1999 end-page: 141 ident: bib5 article-title: Early/tardy scheduling with sequence dependent setups on uniform parallel machines publication-title: Computers and Operations Research – volume: 2832 start-page: 580 year: 2003 end-page: 592 ident: bib23 article-title: More reliable protein NMR peak assignment via improved 2-interval scheduling publication-title: Lecture Notes in Computer Science – volume: 1 start-page: 169 year: 1981 end-page: 197 ident: bib49 article-title: The ellipsoid method and its consequences in combinatorial optimization publication-title: Combinatorica – reference: D. Long, M. Thakur, Scheduling real-time disk transfers for continuous media applications, in: 12th IEEE Symposium on Mass Storage Systems, 1993, pp. 227–232. – volume: 2 start-page: 215 year: 1999 end-page: 227 ident: bib91 article-title: On the approximability of an interval scheduling problem publication-title: Journal of Scheduling – reference: A.J.W. Kolen, J.K. Lenstra, Combinatorics in operations research, in: R. Graham et al. (Eds.), Handbooks of Combinatorics, vol. II. 1995, pp. 1901–1904. – volume: 2 start-page: 80 year: 1970 end-page: 85 ident: bib87 article-title: Convergence rate of the gradient descent method with dilatation of the space publication-title: Kibernetika – volume: 28 start-page: 202 year: 1970 end-page: 208 ident: bib89 article-title: Amortized efficiency of list update and paging rules publication-title: Communications ACM – volume: vol. 26 year: 1996 ident: bib58 publication-title: Cliques Coloring and Satisfiability – year: 1976 ident: bib66 article-title: Combinatorial Optimization: Networks and Matroids – volume: 130 start-page: 5 year: 1994 end-page: 16 ident: bib95 article-title: On-line scheduling of jobs with fixed start and end times publication-title: Theoretical Computer Science – volume: 28 start-page: 807 year: 1979 end-page: 810 ident: bib51 article-title: An optimal solution for the channel-assignment problem publication-title: IEEE Transactions on Computers – volume: 8 start-page: 232 year: 1975 end-page: 248 ident: bib77 article-title: Vertex packings: Structural properties and algorithms publication-title: Mathematical Programming – volume: 28 start-page: 101 year: 2004 end-page: 155 ident: bib86 article-title: Real time scheduling theory: A historical perspective publication-title: Real-Time Systems – volume: 58 start-page: 13 year: 1995 end-page: 17 ident: bib36 article-title: Note on scheduling intervals on-line publication-title: Discrete Applied Mathematics – volume: 130 start-page: 5 year: 1994 ident: 10.1016/j.ejor.2006.01.049_bib95 article-title: On-line scheduling of jobs with fixed start and end times publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(94)90150-3 – volume: 1 start-page: 169 year: 1981 ident: 10.1016/j.ejor.2006.01.049_bib49 article-title: The ellipsoid method and its consequences in combinatorial optimization publication-title: Combinatorica doi: 10.1007/BF02579273 – volume: 45 start-page: 624 year: 1997 ident: 10.1016/j.ejor.2006.01.049_bib64 article-title: Exact and approximation algorithms for the tactical fixed interval scheduling problem publication-title: Operations Research doi: 10.1287/opre.45.4.624 – volume: 48 start-page: 1069 year: 2001 ident: 10.1016/j.ejor.2006.01.049_bib9 article-title: A unified approach to approximating resource allocation and scheduling publication-title: Journal of the ACM doi: 10.1145/502102.502107 – volume: 27 start-page: 993 year: 1998 ident: 10.1016/j.ejor.2006.01.049_bib19 article-title: Bounding the power of preemption in randomized scheduling publication-title: SIAM Journal on Computing doi: 10.1137/S0097539795283292 – volume: 24 start-page: 133 year: 1987 ident: 10.1016/j.ejor.2006.01.049_bib96 article-title: The maximum k-colorable subgraph problem for chordal graphs publication-title: Information Processing Letters doi: 10.1016/0020-0190(87)90107-4 – volume: 26 start-page: 127 year: 1999 ident: 10.1016/j.ejor.2006.01.049_bib5 article-title: Early/tardy scheduling with sequence dependent setups on uniform parallel machines publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(98)00051-3 – volume: 557 start-page: 2 year: 1991 ident: 10.1016/j.ejor.2006.01.049_bib67 article-title: Maximum independent set of a permutation graph in K-tracks publication-title: Lecture Notes in Computer Science doi: 10.1007/3-540-54945-5_43 – volume: 18 start-page: 1 year: 1987 ident: 10.1016/j.ejor.2006.01.049_bib2 article-title: Scheduling jobs with fixed start and finish times publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(87)90037-0 – volume: 12 start-page: 293 year: 1992 ident: 10.1016/j.ejor.2006.01.049_bib59 article-title: On the complexity of scheduling tasks with discrete starting times publication-title: Operations Research Letters doi: 10.1016/0167-6377(92)90087-J – volume: 29 start-page: 176 year: 1980 ident: 10.1016/j.ejor.2006.01.049_bib40 article-title: On chain and antichain families of a partially ordered set publication-title: Journal of Combinatorial Theory Series B doi: 10.1016/0095-8956(80)90079-9 – volume: 2719 start-page: 751 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib11 article-title: Algorithmic aspects of bandwidth trading publication-title: Lecture Notes in Computer Science doi: 10.1007/3-540-45061-0_59 – ident: 10.1016/j.ejor.2006.01.049_bib78 – volume: 40 start-page: S96 year: 1992 ident: 10.1016/j.ejor.2006.01.049_bib39 article-title: Approximation algorithms for fixed job schedule problems publication-title: Operations Research doi: 10.1287/opre.40.1.S96 – volume: 23 start-page: 69 year: 1991 ident: 10.1016/j.ejor.2006.01.049_bib30 article-title: A DSS for capacity planning of aircraft maintenance personnel publication-title: International Journal of Production Research doi: 10.1016/0925-5273(91)90049-Y – volume: 28 start-page: 202 year: 1970 ident: 10.1016/j.ejor.2006.01.049_bib89 article-title: Amortized efficiency of list update and paging rules publication-title: Communications ACM doi: 10.1145/2786.2793 – start-page: 1 year: 1999 ident: 10.1016/j.ejor.2006.01.049_bib13 article-title: The maximum clique problem – volume: vol. 26 year: 1996 ident: 10.1016/j.ejor.2006.01.049_bib58 – volume: 29 start-page: 610 year: 2001 ident: 10.1016/j.ejor.2006.01.049_bib7 article-title: Reactive local search for the maximum clique problem publication-title: Algorithmica doi: 10.1007/s004530010074 – volume: 1 start-page: 217 year: 1954 ident: 10.1016/j.ejor.2006.01.049_bib29 article-title: Minimizing the number of tankers to meet a fixed schedule publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800010309 – start-page: 302 year: 1994 ident: 10.1016/j.ejor.2006.01.049_bib68 article-title: Online interval scheduling – volume: 74 start-page: 79 year: 1996 ident: 10.1016/j.ejor.2006.01.049_bib81 article-title: A primal–dual interior point method whose running time depends only on the constraint matrix publication-title: Mathematical Programming doi: 10.1007/BF02592148 – volume: 14 start-page: 111 year: 1986 ident: 10.1016/j.ejor.2006.01.049_bib84 article-title: Polyhedral proof methods in combinatorial optimization publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(86)90056-9 – volume: 51 start-page: 291 year: 1994 ident: 10.1016/j.ejor.2006.01.049_bib63 article-title: Periodic assignment and graph colouring publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(92)00036-L – ident: 10.1016/j.ejor.2006.01.049_bib53 doi: 10.1145/800158.805069 – volume: 6 start-page: 48 year: 1974 ident: 10.1016/j.ejor.2006.01.049_bib76 article-title: Properties of vertex packings and independence system polyhedra publication-title: Mathematical Programming doi: 10.1007/BF01580222 – volume: 11 start-page: 325 year: 1997 ident: 10.1016/j.ejor.2006.01.049_bib14 article-title: Global escape strategies for maximizing quadratic forms over a simplex publication-title: Journal of Global Optimization doi: 10.1023/A:1008297330705 – volume: 18 start-page: 68 year: 1978 ident: 10.1016/j.ejor.2006.01.049_bib45 article-title: Minimal resources for fixed and variable job schedules publication-title: Operations Research doi: 10.1287/opre.26.1.68 – year: 1993 ident: 10.1016/j.ejor.2006.01.049_bib48 – ident: 10.1016/j.ejor.2006.01.049_bib70 doi: 10.1109/MASS.1993.289755 – volume: 5 start-page: 691 year: 1976 ident: 10.1016/j.ejor.2006.01.049_bib32 article-title: On the complexity of timetable and multicommodity flow problems publication-title: SIAM Journal on Computing doi: 10.1137/0205048 – volume: 29 start-page: 841 year: 2002 ident: 10.1016/j.ejor.2006.01.049_bib55 article-title: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(00)00086-1 – volume: 2832 start-page: 580 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib23 article-title: More reliable protein NMR peak assignment via improved 2-interval scheduling publication-title: Lecture Notes in Computer Science doi: 10.1007/978-3-540-39658-1_53 – volume: 17 start-page: 533 year: 1965 ident: 10.1016/j.ejor.2006.01.049_bib74 article-title: Maxima for graphs and a new proof of a theorem of Turán publication-title: Canadian Journal of Mathematics doi: 10.4153/CJM-1965-053-6 – volume: 31 start-page: 331 year: 2001 ident: 10.1016/j.ejor.2006.01.049_bib8 article-title: Approximating the throughput of multiple machines in real-time scheduling publication-title: SIAM Journal on Computing doi: 10.1137/S0097539799354138 – volume: 54 start-page: 23 year: 1991 ident: 10.1016/j.ejor.2006.01.049_bib61 article-title: On the computational complexity of (maximum) class scheduling publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(91)90320-U – volume: 2279 start-page: 112 year: 2002 ident: 10.1016/j.ejor.2006.01.049_bib71 article-title: Genetic, iterated and multistart local search for the maximum clique problem publication-title: Lecture Notes in Computer Science doi: 10.1007/3-540-46004-7_12 – volume: 60 start-page: 205 year: 1996 ident: 10.1016/j.ejor.2006.01.049_bib79 article-title: A sequential algorithm for finding a maximum weight K-independent set on interval graphs publication-title: International Journal of Computer Mathematics doi: 10.1080/00207169608804486 – volume: 22 start-page: 754 year: 1997 ident: 10.1016/j.ejor.2006.01.049_bib46 article-title: Continuous characterizations of the maximum clique problem publication-title: Mathematics of Operations Research doi: 10.1287/moor.22.3.754 – volume: 2 start-page: 80 year: 1970 ident: 10.1016/j.ejor.2006.01.049_bib87 article-title: Convergence rate of the gradient descent method with dilatation of the space publication-title: Kibernetika – volume: 11 start-page: 2 year: 1994 ident: 10.1016/j.ejor.2006.01.049_bib10 article-title: On the power of randomization in on-line algorithms publication-title: Algorithmica doi: 10.1007/BF01294260 – volume: 13 start-page: 369 year: 1998 ident: 10.1016/j.ejor.2006.01.049_bib12 article-title: On standard quadratic optimization problem publication-title: Journal of Global Optimization doi: 10.1023/A:1008369322970 – volume: 244 start-page: 1093 year: 1979 ident: 10.1016/j.ejor.2006.01.049_bib60 article-title: A polynomial algorithm in linear programming publication-title: Dokladi Akademii Nauk SSSR – volume: 52 start-page: 31 year: 1994 ident: 10.1016/j.ejor.2006.01.049_bib3 article-title: A fast algorithm for the maximum weight clique problem publication-title: Computing doi: 10.1007/BF02243394 – volume: 2719 start-page: 1123 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib75 article-title: Real-time scheduling with a budget publication-title: Lecture Notes in Computer Science doi: 10.1007/3-540-45061-0_86 – volume: 299 start-page: 211 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib24 article-title: Approximation algorithms for NMR spectral peak assignment publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(02)00086-5 – volume: 40 start-page: 28 year: 1992 ident: 10.1016/j.ejor.2006.01.049_bib21 article-title: When is the classroom assignment problem hard? publication-title: Operations Research doi: 10.1287/opre.40.1.S28 – volume: 1969 start-page: 228 year: 2001 ident: 10.1016/j.ejor.2006.01.049_bib33 article-title: Simple algorithms for a weighted interval selection problem publication-title: Lecture Notes in Computer Science doi: 10.1007/3-540-40996-3_20 – volume: 58 start-page: 13 year: 1995 ident: 10.1016/j.ejor.2006.01.049_bib36 article-title: Note on scheduling intervals on-line publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(95)00112-5 – volume: 24 start-page: 106 year: 1986 ident: 10.1016/j.ejor.2006.01.049_bib72 article-title: A heuristic approach to the bus driver scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(86)90016-0 – volume: 31 start-page: 196 year: 1999 ident: 10.1016/j.ejor.2006.01.049_bib35 article-title: A greedy on-line algorithm for the k-track assignment problem publication-title: Journal of Algorithms doi: 10.1006/jagm.1998.1001 – year: 1980 ident: 10.1016/j.ejor.2006.01.049_bib47 – volume: 52 start-page: 97 year: 1994 ident: 10.1016/j.ejor.2006.01.049_bib18 article-title: The k-track assignment problem publication-title: Computing doi: 10.1007/BF02238071 – volume: 25 start-page: 143 year: 2005 ident: 10.1016/j.ejor.2006.01.049_bib26 article-title: Recognizing Berge graphs publication-title: Combinatorica doi: 10.1007/s00493-005-0012-8 – volume: 8 start-page: 232 year: 1975 ident: 10.1016/j.ejor.2006.01.049_bib77 article-title: Vertex packings: Structural properties and algorithms publication-title: Mathematical Programming doi: 10.1007/BF01580444 – volume: 220 start-page: 171 year: 1998 ident: 10.1016/j.ejor.2006.01.049_bib85 article-title: Randomized online interval scheduling publication-title: Operations Research Letters doi: 10.1016/S0167-6377(98)00019-4 – volume: 59 start-page: 225 year: 1995 ident: 10.1016/j.ejor.2006.01.049_bib20 article-title: On the k-coloring of intervals publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(93)E0174-W – volume: 62 start-page: 61 year: 1997 ident: 10.1016/j.ejor.2006.01.049_bib25 article-title: A generalization of chordal graphs and the maximum clique problem publication-title: Information Processing Letters doi: 10.1016/S0020-0190(97)00044-6 – volume: 68 start-page: 291 year: 1998 ident: 10.1016/j.ejor.2006.01.049_bib52 article-title: A simple optimal algorithm for scheduling variable-sized requests publication-title: Information Processing Letters doi: 10.1016/S0020-0190(98)00177-X – ident: 10.1016/j.ejor.2006.01.049_bib62 – volume: 83 start-page: 320 year: 1995 ident: 10.1016/j.ejor.2006.01.049_bib42 article-title: Scheduling jobs within time windows on identical parallel machines: New model and algorithms publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00010-N – volume: 46 start-page: 27 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib34 article-title: Interval selection: Applications, algorithms, and lower bounds publication-title: Journal of Algorithms doi: 10.1016/S0196-6774(02)00291-2 – volume: 43 start-page: 229 year: 1992 ident: 10.1016/j.ejor.2006.01.049_bib56 article-title: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs publication-title: Information Processing Letters doi: 10.1016/0020-0190(92)90216-I – volume: 49 start-page: 743 year: 2002 ident: 10.1016/j.ejor.2006.01.049_bib37 article-title: A branch-and-price algorithm for a hierarchical crew scheduling problem publication-title: Naval Research Logistics doi: 10.1002/nav.10044 – volume: 28 start-page: 101 year: 2004 ident: 10.1016/j.ejor.2006.01.049_bib86 article-title: Real time scheduling theory: A historical perspective publication-title: Real-Time Systems doi: 10.1023/B:TIME.0000045315.61234.1e – ident: 10.1016/j.ejor.2006.01.049_bib57 – volume: 32 start-page: 523 year: 2004 ident: 10.1016/j.ejor.2006.01.049_bib69 article-title: The combinatorics of pivoting for the maximum weight clique publication-title: Operations Research Letters doi: 10.1016/j.orl.2004.02.005 – volume: 34 start-page: 501 year: 2002 ident: 10.1016/j.ejor.2006.01.049_bib22 article-title: Allocation of bandwidth and storage publication-title: IIE Transactions doi: 10.1080/07408170208928886 – volume: 1 start-page: 216 year: 1980 ident: 10.1016/j.ejor.2006.01.049_bib43 article-title: Papadimitriou, The complexity of coloring circular arcs and hords publication-title: SIAM Journal on Algebraic Discrete Methods doi: 10.1137/0601025 – volume: 4 start-page: 291 year: 1984 ident: 10.1016/j.ejor.2006.01.049_bib50 article-title: Corrigendum to our paper, The ellipsoid method and its consequences in combinatorial optimization publication-title: Combinatorica doi: 10.1007/BF02579139 – volume: 19 start-page: 363 year: 1992 ident: 10.1016/j.ejor.2006.01.049_bib80 article-title: A branch and bound algorithm for the maximum clique problem publication-title: Computers and Operations Research doi: 10.1016/0305-0548(92)90067-F – volume: 80 start-page: 1477 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib82 article-title: Maximum weight k-independent set problem on permutation graphs publication-title: International Journal of Computer Mathematics doi: 10.1080/00207160310001614972 – year: 1993 ident: 10.1016/j.ejor.2006.01.049_bib1 – year: 1976 ident: 10.1016/j.ejor.2006.01.049_bib66 – volume: 36 start-page: 1619 year: 1998 ident: 10.1016/j.ejor.2006.01.049_bib54 article-title: Minimizing the sum of job earliness and tardiness in a multi-machine system publication-title: International Journal of Production Research doi: 10.1080/002075498193192 – volume: 53 start-page: 73 year: 2004 ident: 10.1016/j.ejor.2006.01.049_bib17 article-title: Optimal replacement is NP-hard for nonstandard caches publication-title: IEEE Transactions on Computers doi: 10.1109/TC.2004.1255792 – volume: 6 start-page: 131 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib4 article-title: Tight bounds on the competitive ratio on accomodating sequences for the seat reservation problem publication-title: Journal of Scheduling doi: 10.1023/A:1022985808959 – volume: 164 start-page: 51 year: 2006 ident: 10.1016/j.ejor.2006.01.049_bib27 article-title: The strong perfect graph theorem publication-title: Annals of Mathematics doi: 10.4007/annals.2006.164.51 – volume: 2 start-page: 215 year: 1999 ident: 10.1016/j.ejor.2006.01.049_bib91 article-title: On the approximability of an interval scheduling problem publication-title: Journal of Scheduling doi: 10.1002/(SICI)1099-1425(199909/10)2:5<215::AID-JOS27>3.0.CO;2-Y – volume: 28 start-page: 807 year: 1979 ident: 10.1016/j.ejor.2006.01.049_bib51 article-title: An optimal solution for the channel-assignment problem publication-title: IEEE Transactions on Computers doi: 10.1109/TC.1979.1675260 – volume: 127 start-page: 119 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib93 article-title: Aligning two fragmented sequences publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(02)00289-5 – volume: 73 start-page: 181 year: 2000 ident: 10.1016/j.ejor.2006.01.049_bib44 article-title: Maximum weight independent sets and cliques in intersection graphs of filaments publication-title: Information Processing Letters doi: 10.1016/S0020-0190(00)00025-9 – volume: 30 start-page: 1745 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib65 article-title: A note on the maximum number of on-time jobs on parallel identical machines publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(02)00084-9 – volume: 20 start-page: 175 year: 1998 ident: 10.1016/j.ejor.2006.01.049_bib92 article-title: A unified analysis of paging and caching publication-title: Algorithmica doi: 10.1007/PL00009192 – volume: 97 start-page: 405 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib28 article-title: Progress on perfect graphs publication-title: Mathematical Programming Series B doi: 10.1007/s10107-003-0449-8 – volume: 79 start-page: 235 year: 1997 ident: 10.1016/j.ejor.2006.01.049_bib41 article-title: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming publication-title: Mathematical Programming doi: 10.1007/BF02614319 – volume: 25 start-page: 403 year: 1999 ident: 10.1016/j.ejor.2006.01.049_bib16 article-title: The seat reservation problem publication-title: Algorithmica doi: 10.1007/PL00009286 – ident: 10.1016/j.ejor.2006.01.049_bib88 doi: 10.1007/BF02283692 – volume: 40 start-page: S76 year: 1992 ident: 10.1016/j.ejor.2006.01.049_bib31 article-title: Fixed job scheduling with two types of processors publication-title: Operations Research doi: 10.1287/opre.40.1.S76 – volume: 9 start-page: 84 year: 1993 ident: 10.1016/j.ejor.2006.01.049_bib83 article-title: Maximum k-covering of weighted transitive graphs with applications publication-title: Algorithmica doi: 10.1007/BF01185340 – volume: 12 start-page: 522 year: 1987 ident: 10.1016/j.ejor.2006.01.049_bib6 article-title: On the maximum weight clique problem publication-title: Mathematics of Operations Research doi: 10.1287/moor.12.3.522 – volume: 2611 start-page: 236 year: 2003 ident: 10.1016/j.ejor.2006.01.049_bib38 article-title: Searching for maximum cliques with ant colony optimization publication-title: Lecture Notes in Computer Science doi: 10.1007/3-540-36605-9_22 – volume: 93 start-page: 477 year: 2002 ident: 10.1016/j.ejor.2006.01.049_bib94 article-title: The relation of time indexed formulations of single machine scheduling problems to the node packing problem publication-title: Mathematical Programming Series A doi: 10.1007/s10107-002-0335-9 – volume: 26 start-page: 773 year: 1999 ident: 10.1016/j.ejor.2006.01.049_bib90 article-title: Parallel machine scheduling with earliness and tardiness penalties publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(98)00090-2 – volume: 9 start-page: 379 year: 1996 ident: 10.1016/j.ejor.2006.01.049_bib15 article-title: Interval scheduling on identical machines publication-title: Journal of Global Optimization doi: 10.1007/BF00121680 – volume: 7 start-page: 293 year: 2004 ident: 10.1016/j.ejor.2006.01.049_bib73 article-title: An improved randomized on-line algorithm for a weighted interval selection problem publication-title: Journal of Scheduling doi: 10.1023/B:JOSH.0000031423.39762.d3 |
| SSID | ssj0001515 |
| Score | 2.2838519 |
| Snippet | The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed... |
| SourceID | proquest repec pascalfrancis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 331 |
| SubjectTerms | Algorithms Applied sciences Discrete starting times Exact sciences and technology Graph theory Interval graph Interval scheduling k-coloring k-track assignment Maximum weight clique Maximum weight independent set Operational research and scientific management Operational research. Management science Scheduling algorithms Scheduling, sequencing Studies |
| Title | Fixed interval scheduling: Models, applications, computational complexity and algorithms |
| URI | https://dx.doi.org/10.1016/j.ejor.2006.01.049 http://econpapers.repec.org/article/eeeejores/v_3a178_3ay_3a2007_3ai_3a2_3ap_3a331-342.htm https://www.proquest.com/docview/204140005 |
| Volume | 178 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier ScienceDirect Freedom Collection Journals customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: ACRLP dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIKHN dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Science Direct customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AKRWK dateStart: 19770101 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED9trYRAaEABrWxUeeCNZY1jx072Nm1UHRN7gUl9s5zYYZm6NmoyxF742zknTtdKaA9EchJH8Yd89t3ZPv8O4FMWCq5TRnwaqdy3AHR-inLNt1DeLMxYHHF7GvnbFZ9es6-zaLYDZ91ZGGtW6Xh_y9Mbbu2-jF1rjsuiGH8PKGqGYQP_EmDOyS70Uf7EcQ_6pxeX06s1Q7Yyu9lMEMK3CdzZmdbMy9wuV25PghwHFlLz3_LpZakqbLW8dXexpY_2V6Y02YZYmryGPadPeqdtld_AjlkM4Flnzj6AV53bBs-N4gG82MAgfAuzSfHbaK9obB8xJ5ztovSxh9RPPOsobV4deZu73Ede1uToFhGbmAXVrB88tdCemv9cror65q56B9eTLz_Opr5zt-BnTCS1zxONdMMJnlBGizRlxpIxzHIu8iQWRhiSGtQGVWIxsmjOEsqDPFJxyLiOlKHvobdYLsw-eDRFtUrbTc6YMtTxFDMmSHJNVBDoTIdDIF0jy8xhkVuXGHPZGZ3dSksY6ySTy4BIJMwQPq_TlC0Sx5N_Rx3t5FZ_kigqnkw32iL0Y1GxnWkLPoSDjvLSDfcKM2A4UUWGNoTzpjOskxm8sAhTyV-SKiJivD9gsEvE-CjsK4YSA6VEUhbKm_ruw3_W_gCet2vPzCf8EHr16t58RKWpTkewe_yHjNzQwNj55cVfrSIWCg |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB6VVuKhiscCYlsoOXCj6SaxYyfcUGG1QNsLrbQ3y4kdmmq7G20Copf-9s4kTrsroR6I5Lzklzy2Z8YefwPwIY-kMBkPfRbrwicAOj9DvuYTlDePcp7Egk4jH5-IyRn_Po2nG3DYn4Uhs0o393dzejtbuz8j15qjqixHPwOGkmHUwr8EmHP6ALZ4HEnSwA6u7-w8iGO3WwlS-hTdnZzpjLzsxWLpdiTCg4AANf_NnbYrXWObFZ2zizVpdGtpK5uvMKXxc3jqpEnvc1fhF7Bh5wN42BuzD-BZ77TBc2N4AE9WEAhfwnRc_rXGK1vLR8wJdV3kPXRE_ZNHbtJm9b63use97-Vtjm4Jsf0iSM3mytNz4-nZr8WybM4v61dwNv56ejjxnbMFP-cybXyRGqQaqndSWyOzjFsiYpQXQhZpIq20YWZRFtQpIWSxgqdMBEWsk4gLE2vLXsPmfDG3b8BjGQpVhrY4E8ZRwtPc2iAtTKiDwOQmGkLYN7LKHRI5OcSYqd7k7EIRYchFplBBqJAwQ_h4m6bqcDjujR33tFNrvUkho7g33d4aoe-KSkjPlmIIuz3llRvsNWbAUU3F6WwIX9rOcJvM4oVF2Fr9UUyHMsH7FQZaIMZHSa8YKgyMhYrxSJ03lzv_Wfv38Ghyenykjr6d_NiFx90qNPdD8RY2m-Vv-w7Fpybba4fHDX4fFdk |
| 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=Fixed+interval+scheduling%3A+Models%2C+applications%2C+computational+complexity+and+algorithms&rft.jtitle=European+journal+of+operational+research&rft.au=Ng%2C+C.T&rft.au=Kovalyov%2C+Mikhail+Y&rft.au=Cheng%2C+T.C.+Edwin&rft.series=European+Journal+of+Operational+Research&rft.date=2007-04-16&rft.pub=Elsevier&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=178&rft.issue=2&rft.spage=331&rft.epage=342&rft_id=info:doi/10.1016%2Fj.ejor.2006.01.049&rft.externalDocID=eeeejores_v_3a178_3ay_3a2007_3ai_3a2_3ap_3a331_342_htm |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |