Proportionate flow-shop scheduling with rejection
In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for customers. Thus, there is a strong need to provide tools for managers to economically coordinate sourcing and scheduling decisions. Our main aim is...
Saved in:
| Published in: | The Journal of the Operational Research Society Vol. 67; no. 5; pp. 752 - 769 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
London
Taylor & Francis
01.05.2016
Palgrave Macmillan Palgrave Macmillan UK Taylor & Francis Ltd |
| Subjects: | |
| ISSN: | 0160-5682, 1476-9360 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for customers. Thus, there is a strong need to provide tools for managers to economically coordinate sourcing and scheduling decisions. Our main aim is to provide such tools for an important set of flow-shop scheduling problems where rejection (outsourcing) is allowed and processing times are machine-independent. Our scheduling problems are essentially bicriteria problems, which combine a scheduling objective and the total outsourcing cost. We study several problems which differ according to the scheduling criterion considered. Moreover, each problem is divided into four different variations depending on the way the two criteria are dealt with. For example, in one variation the two criteria are aggregated into a single objective function; in two other variations the aim consists of minimizing one criterion subject to ensuring that the value of the other criterion will not exceed a predefined threshold. From a theoretical point of view, a computational complexity classification is provided for all variations of the problems under consideration. Moreover, optimization algorithms have been constructed to solve all problem variations, and approximation schemes have been developed for solving hard variations. Those schemes enable managers to solve large instances of hard variations while controlling the maximal gap between the obtained solution and the (unknown) optimal solution. |
|---|---|
| AbstractList | In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for customers. Thus, there is a strong need to provide tools for managers to economically coordinate sourcing and scheduling decisions. Our main aim is to provide such tools for an important set of flow-shop scheduling problems where rejection (outsourcing) is allowed and processing times are machine-independent. Our scheduling problems are essentially bicriteria problems, which combine a scheduling objective and the total outsourcing cost. We study several problems which differ according to the scheduling criterion considered. Moreover, each problem is divided into four different variations depending on the way the two criteria are dealt with. For example, in one variation the two criteria are aggregated into a single objective function; in two other variations the aim consists of minimizing one criterion subject to ensuring that the value of the other criterion will not exceed a predefined threshold. From a theoretical point of view, a computational complexity classification is provided for all variations of the problems under consideration. Moreover, optimization algorithms have been constructed to solve all problem variations, and approximation schemes have been developed for solving hard variations. Those schemes enable managers to solve large instances of hard variations while controlling the maximal gap between the obtained solution and the (unknown) optimal solution. In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for customers. Thus, there is a strong need to provide tools for managers to economically coordinate sourcing and scheduling decisions. Our main aim is to provide such tools for an important set of flow-shop scheduling problems where rejection (outsourcing) is allowed and processing times are machineindependent. Our scheduling problems are essentially bicriteria problems, which combine a scheduling objective and the total outsourcing cost. We study several problems which differ according to the scheduling criterion considered. Moreover, each problem is divided into four different variations depending on the way the two criteria are dealt with. For example, in one variation the two criteria are aggregated into a single objective function; in two other variations the aim consists of minimizing one criterion subject to ensuring that the value of the other criterion will not exceed a predefined threshold. From a theoretical point of view, a computational complexity classification is provided for all variations of the problems under consideration. Moreover, optimization algorithms have been constructed to solve all problem variations, and approximation schemes have been developed for solving hard variations. Those schemes enable managers to solve large instances of hard variations while controlling the maximal gap between the obtained solution and the (unknown) optimal solution. |
| Author | Oron, Daniel Shabtay, Dvir |
| Author_xml | – sequence: 1 givenname: Dvir surname: Shabtay fullname: Shabtay, Dvir organization: Ben-Gurion University of the Negev – sequence: 2 givenname: Daniel surname: Oron fullname: Oron, Daniel email: daniel.oron@sydney.edu.au organization: The University of Sydney |
| BookMark | eNp1kM1r20AQxZeQQu20t14DhlwrZ0bSfh2LadpAID3kvqzWu7GEonVn1xj_95FQCaE4pzm833vzeEt2OcTBM_YNYY3A5W0XKa1LQL7W_IItsJai0JWAS7YAFFBwocrPbJlSBwAaUC8Y_qG4j5TbONjsV6GPxyLt4n6V3M5vD307PK-Obd6tyHfeTdgX9inYPvmv_-4Ve7r7-bT5XTw8_rrf_HgoXA1lLrZbbEQZbABsgnON8oI7rbUSvEERAFQDHlFwUTuphHSON1JLiWB5XVbVFbuZY_cU_x58yqaLBxrGjwalqkVVC1QjVc6Uo5gS-WBcm-1UM5Nte4NgpmXMtIyZljGaj6bv_5n21L5YOn2EFzOeRmx49vSuyXn-eua7lCO9Zde1Vgo0jrqc9XYIkV7sMVK_Ndme-kiB7ODaZKqzya-5TpNt |
| CODEN | OPRQAK |
| CitedBy_id | crossref_primary_10_1002_nav_22097 crossref_primary_10_1080_01605682_2018_1495996 crossref_primary_10_1016_j_tcs_2017_09_004 crossref_primary_10_1080_01605682_2019_1621222 crossref_primary_10_1007_s11590_023_02077_7 crossref_primary_10_1007_s11766_020_3624_2 crossref_primary_10_1142_S0217595924500118 crossref_primary_10_1016_j_omega_2020_102313 crossref_primary_10_1080_00207543_2020_1740345 crossref_primary_10_1007_s12351_025_00951_z crossref_primary_10_1007_s10951_025_00855_y crossref_primary_10_20965_ijat_2019_p0787 crossref_primary_10_1016_j_cie_2022_108168 crossref_primary_10_1080_01605682_2025_2492817 crossref_primary_10_1080_01605682_2018_1506540 crossref_primary_10_1080_01605682_2021_1915191 crossref_primary_10_1007_s10951_022_00731_z crossref_primary_10_1007_s40314_020_1130_z crossref_primary_10_1080_01605682_2020_1806746 crossref_primary_10_1016_j_ejor_2024_03_021 crossref_primary_10_1142_S0217595923500239 crossref_primary_10_1016_j_ejor_2020_12_061 crossref_primary_10_1007_s10479_024_06275_z crossref_primary_10_1007_s12351_021_00629_2 crossref_primary_10_1016_j_ejor_2022_03_043 |
| Cites_doi | 10.1016/j.ejor.2005.09.030 10.1007/978-3-642-02026-1_39 10.1016/S0196-6774(03)00078-6 10.1016/j.ijpe.2015.03.013 10.1007/s10951-012-0303-z 10.1007/978-1-4684-2001-2_9 10.1007/s10878-010-9350-6 10.1111/j.1540-5915.1991.tb00353.x 10.1016/j.ejor.2010.09.042 10.1016/j.cor.2012.04.009 10.1016/0167-6377(94)90041-8 10.1016/j.cor.2011.05.023 10.1007/s10107-005-0641-0 10.1145/321921.321934 10.1016/j.ejor.2011.03.017 10.1007/s11424-007-9050-1 10.1016/j.ejor.2011.03.037 10.1007/978-3-642-80784-8_2 10.1007/978-3-540-45078-8_8 10.1016/j.ijpe.2012.06.003 10.1016/j.ijpe.2012.08.020 10.1287/ijoc.12.1.57.11901 10.1016/j.tcs.2009.04.006 10.1145/321906.321909 10.1016/j.ejor.2007.11.047 10.1016/j.cor.2010.09.018 10.1137/130925153 10.1007/978-3-540-87744-8_50 10.1201/9780203489802 10.1287/ijoc.1050.0167 10.1016/0377-2217(81)90175-2 10.1016/j.amc.2012.01.073 10.1023/A:1009813105532 10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y |
| ContentType | Journal Article |
| Copyright | Copyright © 2015, Operational Research Society Ltd. 2015 Copyright © 2016 Operational Research Society Ltd Operational Research Society Ltd. 2015 Operational Research Society Ltd. 2016 |
| Copyright_xml | – notice: Copyright © 2015, Operational Research Society Ltd. 2015 – notice: Copyright © 2016 Operational Research Society Ltd – notice: Operational Research Society Ltd. 2015 – notice: Operational Research Society Ltd. 2016 |
| DBID | AAYXX CITATION 3V. 7RQ 7WY 7WZ 7X7 7XB 87Z 88E 8AL 8FE 8FG 8FI 8FJ 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG FYUFA F~G GHDGH GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- K9. L.- L.0 L6V M0C M0N M0S M1P M2O M7S MBDVC P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U U9A |
| DOI | 10.1057/jors.2015.95 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Career & Technical Education Database ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Medical Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Research Library (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni Edition) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Korea Business Premium Collection (Alumni) Health Research Premium Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ABI/INFORM Professional Standard ProQuest Engineering Collection ABI/INFORM Global Computing Database Health & Medical Collection (Alumni Edition) Medical Database Research Library Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Engineering Collection Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Career and Technical Education ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing Research Library (Alumni Edition) ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection ProQuest Engineering Collection Health and Medicine Complete (Alumni Edition) ABI/INFORM Professional Standard ProQuest Central Korea ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest Medical Library Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) Computer Science Business |
| EISSN | 1476-9360 |
| EndPage | 769 |
| ExternalDocumentID | 4036749491 10_1057_jors_2015_95 44988091 11944527 |
| Genre | Research Article Feature |
| GroupedDBID | -~X .DC 0BK 0R~ 29L 30N 3R3 4.4 5GY 7RQ 7WY 7X7 88E 8FE 8FG 8FI 8FJ 8FL 8G5 8R4 8R5 AAAZS AAGDL AAHIA AAIAL AAJMT AALDU AAMIU AAPUL AAQRR AAXLS ABAWQ ABBHK ABJCF ABJNI ABKVW ABLIJ ABLJU ABLWH ABMNI ABPAQ ABPPZ ABUWG ABXSQ ABXUL ABXYU ABYYQ ACGFO ACHJO ACHQT ACIWK ACNCT ACREN ACTIO ACXJH ADBBV ADEPB ADFRT ADGDI ADGTB ADMHG ADNFJ ADULT AEBJH AECXW AEISY AENEX AEUPB AEXYK AEYOC AFAIT AFKRA AFRVT AFTQD AGAYW AGDLA AGKTX AHAJD AHDZW AHSBF AIYEW AJRNO AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AMKLP AMTXH APTMU AQRUH AQTUD ARAPS ASMEE ASPBG AVWKF AWYRJ AXYYD AZQEC BENPR BEZIV BGLVJ BKKNO BLEHA BPHCQ BVXVI CBXGM CCCUG CCKSF CCPQU CS3 CYVLN DGEBU DU5 DWQXO EBS EJD F5P FEFRA FRNLG FYUFA GENNL GNUQQ GROUPED_ABI_INFORM_RESEARCH GUQSH HCIFZ HMCUK IPSME JAAYA JAV JBC JBMMH JBZCM JENOY JHFFW JKQEH JLEZI JLXEF JPL JPPEU JST K60 K6V K6~ K7- KYCEM L6V M0C M1P M2O M4Z M7S MS~ O9- P2P P62 PHGZM PHGZT PJZUB PPXIY PQBIZ PQBZA PQGLB PQQKQ PROAC PSQYO PTHSS Q2X RNANH ROSJB RPC RSV RTWRZ SA0 SOJ TAJZE TASJS TBQAZ TDBHL TEN TFL TFT TFW TN5 TTHFI TUROJ U5U UKHRP WH7 XSW ZGOLN ~02 AAYZH ADYSH ALIPV AMPGV 3V. AJPNJ AQSKT CSNOR JSODD M0N PKN SNX VQA 1OL 3EH AARHV AAYXX ABDPE ACTTO ADMLS ADUMR ADXEU AEHZU AEZBV AFBWG AFFHD AFFNX AGBKS AGVKY AGWUF AGYFW AI. AKHJE AKMBP ALRRR BGSSV CAG CITATION COF CYRSC DAOYK GUPYA HGD HVGLF H~9 IFELN LJTGL N8N NHB NUSFT PLIJB RNS VH1 ZCG 7XB 8AL 8FK JQ2 K9. L.- L.0 MBDVC PKEHL PQEST PQUKI PRINS Q9U U9A |
| ID | FETCH-LOGICAL-c402t-dd1b62faf01bfccb8e65c999865b16f008b0e116564c7867cc5b797710a54233 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 28 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000376420200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0160-5682 |
| IngestDate | Mon Oct 06 17:16:26 EDT 2025 Tue Nov 18 22:24:13 EST 2025 Sat Nov 29 06:38:24 EST 2025 Fri Feb 21 02:38:27 EST 2025 Fri Jun 20 01:33:11 EDT 2025 Mon Oct 20 23:42:20 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | proportionate flow-shop scheduling with rejection pseudo-polynomial time algorithm |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c402t-dd1b62faf01bfccb8e65c999865b16f008b0e116564c7867cc5b797710a54233 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 1784634618 |
| PQPubID | 31386 |
| PageCount | 18 |
| ParticipantIDs | springer_journals_10_1057_jors_2015_95 jstor_primary_44988091 informaworld_taylorfrancis_310_1057_jors_2015_95 crossref_citationtrail_10_1057_jors_2015_95 proquest_journals_1784634618 crossref_primary_10_1057_jors_2015_95 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-05-01 |
| PublicationDateYYYYMMDD | 2016-05-01 |
| PublicationDate_xml | – month: 05 year: 2016 text: 2016-05-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: Abingdon |
| PublicationTitle | The Journal of the Operational Research Society |
| PublicationTitleAbbrev | J Oper Res Soc |
| PublicationYear | 2016 |
| Publisher | Taylor & Francis Palgrave Macmillan Palgrave Macmillan UK Taylor & Francis Ltd |
| Publisher_xml | – name: Taylor & Francis – name: Palgrave Macmillan – name: Palgrave Macmillan UK – name: Taylor & Francis Ltd |
| References | WangXLXieXZChengTCEA modified artificial bee colony algorithm for order acceptance in two-machine flow shopsInternational Journal of Production Economics20131411142310.1016/j.ijpe.2012.06.003 McGovernGQuelchJOutsourcing marketingHarvard Business Review20058323 PinedoMScheduling: Theory, Algorithms and Systems2008Prentice-Hall: New Jersey CaoZYangXA PTAS for parallel batch scheduling with rejection and dynamic job arrivalsTheoretical Computer Science2009410272732274510.1016/j.tcs.2009.04.006 ChoiBCYoonSHChungSJMinimizing maximum completion time in a proportionate flow shop with one machine of different speedEuropean Journal of Operational Research2007176296497410.1016/j.ejor.2005.09.030 Lawler EL (1977). Fast approximation algorithms for knapsack problems. In: Proceedings of the 18th Annual Symposium on Foundation of Computer Science, IEEE Computer Society, Long Beach, CA, pp 206–213. GuerreroHHKernGMHow to more effectively accept and refuse ordersProduction and Inventory Management19882945963 DePGhoshJBWellsCEOptimal delivery time quotation and order SequencingDecision Sciences199122237939010.1111/j.1540-5915.1991.tb00353.x Zhang L, Lu L and Li S (2015). New results on two-machine flow-shop scheduling with rejection, to appear in. Journal of Combinatorial Optimization doi:10.1007/s10878-015-9836-3. GaoQLuXTwo-machine flow shop scheduling with individual operation's rejectionAsia-Pacific Journal of Operational Research2014311113 IbarraOKimCFast approximation algorithms for the sum of subsets problemsJournal of the ACM197522446346810.1145/321906.321909 Cao Z, Wang A, Zhang Y and Liu S (2006). On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times. Lecture Notes in Computer Science, Vol. 3959, Springer-Verlag: Berlin, Heidelberg, pp 90–98. CesaretBOğuzCSalmanFSA Tabu search algorithm for order acceptance and schedulingComputers and Operations Research20123961197120510.1016/j.cor.2010.09.018 XiaoYYZhangRQZhaoQHKakuIPermutation flow shop scheduling with order acceptance and weighted tardinessApplied Mathematics and Computation2012218157911792610.1016/j.amc.2012.01.073 PanwalkerSSDudekRASmithMLSequencing research and the industrial problemSymposium on the Theory of Scheduling and its Applications1973293810.1007/978-3-642-80784-8_2Springer: Berlin LeiDGuoXA parallel neighborhood search for order acceptance and scheduling in flow shop environmentInternational Journal of Production Economics2015165121810.1016/j.ijpe.2015.03.013 SahniSAlgorithms for scheduling independent tasksJournal of the ACM197623111612710.1145/321921.321934 ShabtayDGasparNYedidsionLA bicriteria approach to scheduling a single machine with job rejection and positional penaltiesJournal of Combinatorial Optimization201223439542410.1007/s10878-010-9350-6 KhullerSMestreJAn optimal incremental algorithm for minimizing lateness with rejectionLecture Notes in Computer Science2008519360161010.1007/978-3-540-87744-8_50 MagazineMJOguzOA fully polynomial approximation algorithm for the 0–1 Knapsack problemEuropean Journal of Operational Research19818327027310.1016/0377-2217(81)90175-2 T’kindtVDella CroceFBouquardJLEnumeration of pareto optima for a flowshop scheduling problem with two criteriaINFORMS Journal of Computing2007191647210.1287/ijoc.1050.0167 LeeKChoiBCTwo-stage production scheduling with an outsourcing optionEuropean Journal of Operational Research2011213348949710.1016/j.ejor.2011.03.037 ShakhlevichNHoogeveenHPinedoMMinimizing total weighted completion time in a proportionate flow shopJournal of Scheduling19981315716810.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y T’kindtVBillautJCMulticriteria Scheduling: Theory, Models and Algorithms2006Springer: Berlin LeungJYTHandbook of Scheduling: Algorithms, Models, and Performance Analysis2004CRC Press: New York CaoZZhangYScheduling with rejection and non-identical job arrivalsJournal of Systems Science and Complexity200720452953510.1007/s11424-007-9050-1 KarpRMReducibility among combinatorial problemsComplexity of Computer Computations19728510310.1007/978-1-4684-2001-2_9Plenum Press: New York ChengYSunSScheduling linear deteriorating jobs with rejection on a single machineEuropean Journal of Operational Research20071941182710.1016/j.ejor.2007.11.047 WoegingerGJWhen does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?INFORMS Journal of Computing2000121577410.1287/ijoc.12.1.57.11901 ZhangYRenJWangCScheduling with rejection to minimize the makespanLecture Notes in Computer Science2009557341142010.1007/978-3-642-02026-1_39 KellererHPferschyUA new fully polynomial approximation scheme for the Knapsack problemJournal of Combinatorial Optimization199931597110.1023/A:1009813105532 SenguptaSAlgorithms and approximation schemes for minimum lateness/ tardiness scheduling with rejectionLecture Notes in Computer Science20032748799010.1007/978-3-540-45078-8_8 SlotnickSAOrder acceptance and scheduling: A taxonomy and reviewEuropean Journal of Operational Research2011212111110.1016/j.ejor.2010.09.042 ShabtayDGasparNTwo-machine flow-shop with rejectionComputers and Operations Research20123951087109610.1016/j.cor.2011.05.023 T’kindtVCroceFDA note on ‘two-machine flow-shop scheduling with rejection’ and its link with flow-shop scheduling and common due date assignmentComputers & Operations Research201239123244324610.1016/j.cor.2012.04.009 Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J and Stougie L (2000). Multiprocessor scheduling with rejection. In: Seventh ACM-SIAM Symposium on Discrete Algorithms. Atlanta, Georgia, pp 95–103. ChoiBCChungJTwo-machine flow shop scheduling problem with an outsourcing optionEuropean Journal of Operational Research20112131667210.1016/j.ejor.2011.03.017 ChubanovSKovalyovMPeschEAn FPTAS for a single-item capacity economic lot-sizing problem with monotone cost structureMathematical Programming, Series A2006106345346610.1007/s10107-005-0641-0 JózefowskaJJurischBKubiakWScheduling shops to minimize the weighted number of late jobsOperations Research Letters199416527728310.1016/0167-6377(94)90041-8 WangXLXieXZChengTCEOrder acceptance and scheduling in a two-machine flowshopInternational Journal of Production Economics2013141236637610.1016/j.ijpe.2012.08.020 DreyfusSEBellmanREApplied Dynamic Programming1962Princeton University Press: Santa Monica EngelsDWKargerDRKolliopoulosSGSeguptaSUmaRNWeinJTechniques for scheduling with rejectionJournal of Algorithms200349117519110.1016/S0196-6774(03)00078-6 HalmanNKlabjanDLiCLOrlinJSimchi-LeviDFully polynomial time approximation schemes for stochastic dynamic programmingSIAM Journal of Discrete Mathematics20142841725179610.1137/130925153 ShabtayDGasparNKaspiMA survey on scheduling problems with rejectionJournal of Scheduling201316132810.1007/s10951-012-0303-z CIT0030 CIT0010 CIT0032 CIT0031 CIT0012 CIT0034 CIT0033 Gao Q (CIT0013) 2014; 31 Karp RM (CIT0018) 1972 McGovern G (CIT0026) 2005; 83 CIT0035 CIT0016 CIT0038 CIT0015 CIT0037 Leung JYT (CIT0024) 2004 CIT0017 CIT0039 CIT0019 CIT0041 CIT0040 CIT0020 CIT0042 CIT0023 CIT0022 CIT0044 Pinedo M (CIT0028) 2008 T’kindt V (CIT0036) 2006 Guerrero HH (CIT0014) 1988; 29 Dreyfus SE (CIT0011) 1962 Panwalker SS (CIT0027) 1973 CIT0003 CIT0025 CIT0005 CIT0004 CIT0007 CIT0029 CIT0006 CIT0009 CIT0008 |
| References_xml | – reference: CesaretBOğuzCSalmanFSA Tabu search algorithm for order acceptance and schedulingComputers and Operations Research20123961197120510.1016/j.cor.2010.09.018 – reference: ChengYSunSScheduling linear deteriorating jobs with rejection on a single machineEuropean Journal of Operational Research20071941182710.1016/j.ejor.2007.11.047 – reference: JózefowskaJJurischBKubiakWScheduling shops to minimize the weighted number of late jobsOperations Research Letters199416527728310.1016/0167-6377(94)90041-8 – reference: WangXLXieXZChengTCEA modified artificial bee colony algorithm for order acceptance in two-machine flow shopsInternational Journal of Production Economics20131411142310.1016/j.ijpe.2012.06.003 – reference: WangXLXieXZChengTCEOrder acceptance and scheduling in a two-machine flowshopInternational Journal of Production Economics2013141236637610.1016/j.ijpe.2012.08.020 – reference: GaoQLuXTwo-machine flow shop scheduling with individual operation's rejectionAsia-Pacific Journal of Operational Research2014311113 – reference: EngelsDWKargerDRKolliopoulosSGSeguptaSUmaRNWeinJTechniques for scheduling with rejectionJournal of Algorithms200349117519110.1016/S0196-6774(03)00078-6 – reference: CaoZZhangYScheduling with rejection and non-identical job arrivalsJournal of Systems Science and Complexity200720452953510.1007/s11424-007-9050-1 – reference: Zhang L, Lu L and Li S (2015). New results on two-machine flow-shop scheduling with rejection, to appear in. Journal of Combinatorial Optimization doi:10.1007/s10878-015-9836-3. – reference: ShabtayDGasparNTwo-machine flow-shop with rejectionComputers and Operations Research20123951087109610.1016/j.cor.2011.05.023 – reference: McGovernGQuelchJOutsourcing marketingHarvard Business Review20058323 – reference: ZhangYRenJWangCScheduling with rejection to minimize the makespanLecture Notes in Computer Science2009557341142010.1007/978-3-642-02026-1_39 – reference: DePGhoshJBWellsCEOptimal delivery time quotation and order SequencingDecision Sciences199122237939010.1111/j.1540-5915.1991.tb00353.x – reference: LeiDGuoXA parallel neighborhood search for order acceptance and scheduling in flow shop environmentInternational Journal of Production Economics2015165121810.1016/j.ijpe.2015.03.013 – reference: PanwalkerSSDudekRASmithMLSequencing research and the industrial problemSymposium on the Theory of Scheduling and its Applications1973293810.1007/978-3-642-80784-8_2Springer: Berlin – reference: DreyfusSEBellmanREApplied Dynamic Programming1962Princeton University Press: Santa Monica – reference: KellererHPferschyUA new fully polynomial approximation scheme for the Knapsack problemJournal of Combinatorial Optimization199931597110.1023/A:1009813105532 – reference: T’kindtVBillautJCMulticriteria Scheduling: Theory, Models and Algorithms2006Springer: Berlin – reference: GuerreroHHKernGMHow to more effectively accept and refuse ordersProduction and Inventory Management19882945963 – reference: ShabtayDGasparNYedidsionLA bicriteria approach to scheduling a single machine with job rejection and positional penaltiesJournal of Combinatorial Optimization201223439542410.1007/s10878-010-9350-6 – reference: KarpRMReducibility among combinatorial problemsComplexity of Computer Computations19728510310.1007/978-1-4684-2001-2_9Plenum Press: New York – reference: SahniSAlgorithms for scheduling independent tasksJournal of the ACM197623111612710.1145/321921.321934 – reference: XiaoYYZhangRQZhaoQHKakuIPermutation flow shop scheduling with order acceptance and weighted tardinessApplied Mathematics and Computation2012218157911792610.1016/j.amc.2012.01.073 – reference: SenguptaSAlgorithms and approximation schemes for minimum lateness/ tardiness scheduling with rejectionLecture Notes in Computer Science20032748799010.1007/978-3-540-45078-8_8 – reference: PinedoMScheduling: Theory, Algorithms and Systems2008Prentice-Hall: New Jersey – reference: MagazineMJOguzOA fully polynomial approximation algorithm for the 0–1 Knapsack problemEuropean Journal of Operational Research19818327027310.1016/0377-2217(81)90175-2 – reference: T’kindtVCroceFDA note on ‘two-machine flow-shop scheduling with rejection’ and its link with flow-shop scheduling and common due date assignmentComputers & Operations Research201239123244324610.1016/j.cor.2012.04.009 – reference: SlotnickSAOrder acceptance and scheduling: A taxonomy and reviewEuropean Journal of Operational Research2011212111110.1016/j.ejor.2010.09.042 – reference: WoegingerGJWhen does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?INFORMS Journal of Computing2000121577410.1287/ijoc.12.1.57.11901 – reference: ChoiBCChungJTwo-machine flow shop scheduling problem with an outsourcing optionEuropean Journal of Operational Research20112131667210.1016/j.ejor.2011.03.017 – reference: LeungJYTHandbook of Scheduling: Algorithms, Models, and Performance Analysis2004CRC Press: New York – reference: ChoiBCYoonSHChungSJMinimizing maximum completion time in a proportionate flow shop with one machine of different speedEuropean Journal of Operational Research2007176296497410.1016/j.ejor.2005.09.030 – reference: LeeKChoiBCTwo-stage production scheduling with an outsourcing optionEuropean Journal of Operational Research2011213348949710.1016/j.ejor.2011.03.037 – reference: ChubanovSKovalyovMPeschEAn FPTAS for a single-item capacity economic lot-sizing problem with monotone cost structureMathematical Programming, Series A2006106345346610.1007/s10107-005-0641-0 – reference: Lawler EL (1977). Fast approximation algorithms for knapsack problems. In: Proceedings of the 18th Annual Symposium on Foundation of Computer Science, IEEE Computer Society, Long Beach, CA, pp 206–213. – reference: KhullerSMestreJAn optimal incremental algorithm for minimizing lateness with rejectionLecture Notes in Computer Science2008519360161010.1007/978-3-540-87744-8_50 – reference: CaoZYangXA PTAS for parallel batch scheduling with rejection and dynamic job arrivalsTheoretical Computer Science2009410272732274510.1016/j.tcs.2009.04.006 – reference: Cao Z, Wang A, Zhang Y and Liu S (2006). On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times. Lecture Notes in Computer Science, Vol. 3959, Springer-Verlag: Berlin, Heidelberg, pp 90–98. – reference: HalmanNKlabjanDLiCLOrlinJSimchi-LeviDFully polynomial time approximation schemes for stochastic dynamic programmingSIAM Journal of Discrete Mathematics20142841725179610.1137/130925153 – reference: T’kindtVDella CroceFBouquardJLEnumeration of pareto optima for a flowshop scheduling problem with two criteriaINFORMS Journal of Computing2007191647210.1287/ijoc.1050.0167 – reference: IbarraOKimCFast approximation algorithms for the sum of subsets problemsJournal of the ACM197522446346810.1145/321906.321909 – reference: Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J and Stougie L (2000). Multiprocessor scheduling with rejection. In: Seventh ACM-SIAM Symposium on Discrete Algorithms. Atlanta, Georgia, pp 95–103. – reference: ShabtayDGasparNKaspiMA survey on scheduling problems with rejectionJournal of Scheduling201316132810.1007/s10951-012-0303-z – reference: ShakhlevichNHoogeveenHPinedoMMinimizing total weighted completion time in a proportionate flow shopJournal of Scheduling19981315716810.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y – volume-title: Applied Dynamic Programming year: 1962 ident: CIT0011 – ident: CIT0008 doi: 10.1016/j.ejor.2005.09.030 – volume: 29 start-page: 59 issue: 4 year: 1988 ident: CIT0014 publication-title: Production and Inventory Management – ident: CIT0044 doi: 10.1007/978-3-642-02026-1_39 – ident: CIT0012 doi: 10.1016/S0196-6774(03)00078-6 – ident: CIT0023 doi: 10.1016/j.ijpe.2015.03.013 – volume: 83 start-page: 2 year: 2005 ident: CIT0026 publication-title: Harvard Business Review – volume-title: Scheduling: Theory, Algorithms and Systems year: 2008 ident: CIT0028 – ident: CIT0032 doi: 10.1007/s10951-012-0303-z – start-page: 85 volume-title: Complexity of Computer Computations year: 1972 ident: CIT0018 doi: 10.1007/978-1-4684-2001-2_9 – ident: CIT0033 doi: 10.1007/s10878-010-9350-6 – ident: CIT0010 doi: 10.1111/j.1540-5915.1991.tb00353.x – ident: CIT0035 doi: 10.1016/j.ejor.2010.09.042 – ident: CIT0037 doi: 10.1016/j.cor.2012.04.009 – ident: CIT0017 doi: 10.1016/0167-6377(94)90041-8 – ident: CIT0031 doi: 10.1016/j.cor.2011.05.023 – ident: CIT0009 doi: 10.1007/s10107-005-0641-0 – ident: CIT0029 doi: 10.1145/321921.321934 – ident: CIT0007 doi: 10.1016/j.ejor.2011.03.017 – ident: CIT0004 doi: 10.1007/s11424-007-9050-1 – ident: CIT0022 doi: 10.1016/j.ejor.2011.03.037 – start-page: 29 volume-title: Symposium on the Theory of Scheduling and its Applications year: 1973 ident: CIT0027 doi: 10.1007/978-3-642-80784-8_2 – ident: CIT0030 doi: 10.1007/978-3-540-45078-8_8 – ident: CIT0039 doi: 10.1016/j.ijpe.2012.06.003 – ident: CIT0040 doi: 10.1016/j.ijpe.2012.08.020 – ident: CIT0041 doi: 10.1287/ijoc.12.1.57.11901 – ident: CIT0003 doi: 10.1016/j.tcs.2009.04.006 – ident: CIT0016 doi: 10.1145/321906.321909 – ident: CIT0006 doi: 10.1016/j.ejor.2007.11.047 – ident: CIT0005 doi: 10.1016/j.cor.2010.09.018 – ident: CIT0015 doi: 10.1137/130925153 – ident: CIT0020 doi: 10.1007/978-3-540-87744-8_50 – volume-title: Handbook of Scheduling: Algorithms, Models, and Performance Analysis year: 2004 ident: CIT0024 doi: 10.1201/9780203489802 – ident: CIT0038 doi: 10.1287/ijoc.1050.0167 – ident: CIT0025 doi: 10.1016/0377-2217(81)90175-2 – ident: CIT0042 doi: 10.1016/j.amc.2012.01.073 – volume: 31 start-page: 1 issue: 1 year: 2014 ident: CIT0013 publication-title: Asia-Pacific Journal of Operational Research – volume-title: Multicriteria Scheduling: Theory, Models and Algorithms year: 2006 ident: CIT0036 – ident: CIT0019 doi: 10.1023/A:1009813105532 – ident: CIT0034 doi: 10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y |
| SSID | ssj0009019 |
| Score | 2.2806334 |
| Snippet | In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for... |
| SourceID | proquest crossref springer jstor informaworld |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 752 |
| SubjectTerms | Algorithms Business and Management Decision making FPTAS General Paper General Papers Integer programming Job shops Management Operations research Operations Research/Decision Theory Optimization algorithms Outsourcing Production capacity Production scheduling proportionate flow-shop pseudo-polynomial time algorithm Scheduling scheduling with rejection Studies |
| SummonAdditionalLinks | – databaseName: Computer Science Database dbid: K7- link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB58IXrwsSquL3pQUSTa9JHHSUQUQREPIt5Ck6boItu1rfr3TbKprqJevLZpSplJ5svM9PsAtmUWs4hLijjTIUqyOERSao7yCOcyZJRJV2i_u6LX1-z-nt_4hFvt2yrbPdFt1HmpbI78CFMTKeOEYHY8eEZWNcpWV72ExjhM4ijC1s8vKfok3Q2dsIclUUMpYZFvfDcQ5ahXVpasG6eHVlliJCR9ISxtmxS_wM9vFVMXiM7n__sJCzDnIWhwMvSZRRjT_Q5Mtx3wHZhvlR4Cv_A7MDtCW9iBRX-9DvY8a_X-EuAbq7dQudRio4PiqXxD9UM5CMzx2YQz-9d7YJO-QaV7rv2rvwy352e3pxfI6zEgZU6ZDcpzLElUZEWIZaGUZJqkygBMRlKJSWHQhAy1o_NJFGWEKpVKavAlDrPUoLZ4BSb6ZV-vQpDrOCM6V1znOJHmkIYt0xyjRcwIzijvwkFrEaE8V7mVzHgSrmaeUmHtJ6z9BE-7sPMxejDk6PhlXDhqXNG4nEgxFDAR8c-PrDgH-Jg3SbjZ8TjuwkZrY-FXfS0-DdyF3dZLRm7_8IK1v-dZhxkzkAw7LDdgoqle9CZMqdfmsa62nLe_A4KHBtU priority: 102 providerName: ProQuest – databaseName: SpringerLink Contemporary (1997 - Present) dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB50FdGDj1VxfdGDiiLRZtu8jiKKBxFREW-hSVNUZFfaqn_fJJuuu6Kgt9ImbckknW8y0-8D2FFZwrtCMSS4iVGaJTFSygiUd3GuYs648on2-0t2dcUfHsR1CBSrptq9SUn6L3XQoj1-7peOXhuTI0EmYco6Ou4W4s3t_RfJbuyFPBxpGiKUd0Oh-_feYy5ojKC0KUocg5vfMqTe8Zwv_PeVF2E-QMzoZDAnlmDC9Now01S4t2GhUXKIwsJuw9wILWEblsL5KtoPrNQHy4CvnZ5C6bcOaxMVL_0PVD32XyMbHlt35f5qj9ymblSaZ1_e1VuBu_Ozu9MLFPQWkLZRZI3yHCvaLbIixqrQWnFDibYAklOiMC0sWlCx8XQ9qWacMq2JYhY_4jgjFpUlq9Dq9XtmDaLcJBk1uRYmx6myQRh2THKcFQmnOGOiA4eNBaQOXOROEuNF-pw4YdINnXRDJwXpwO6w9euAg-OXdvGoMWXt9zyKgUCJTH7usuoNPrxvmgr7RRO4A5vNDJBhVVcSM4vWkpRi3oG9xuIjl394wPpfG27ArD2ig1rKTWjV5ZvZgmn9Xj9V5baf558Kaftj priority: 102 providerName: Springer Nature |
| Title | Proportionate flow-shop scheduling with rejection |
| URI | https://www.tandfonline.com/doi/abs/10.1057/jors.2015.95 https://www.jstor.org/stable/44988091 https://link.springer.com/article/10.1057/jors.2015.95 https://www.proquest.com/docview/1784634618 |
| Volume | 67 |
| WOSCitedRecordID | wos000376420200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: 7WY dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: M0C dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: P5Z dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Career & Technical Education Database customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: 7RQ dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/career providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: K7- dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: M7S dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: 7X7 dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: BENPR dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: M2O dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLink customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature – providerCode: PRVAWR databaseName: Taylor and Francis Online Journals customDbUrl: eissn: 1476-9360 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: TFW dateStart: 19500301 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED-NgRA8MFaYKIwqD4BAyBAn8dcjTKuQgFK6aiu8WLHjCKapnZIA_z4-JxntNB7g5ZQPO7Hss_07-_w7gCcmT2WijCBKuphkeRoTY5wiRUILE0shTdhoP_4gJhO5WKjpFsj-LAy6VaINXbZEEWGsxs6dm7qPSvv6dFUh0TZlrxSeLveAHlV7Pj75w7Ybh4geyJ5GGJdJ5_F-OfPGXLTBVNp7J27gzktbpWEGGu_8f9nvwp0OdUZvWjXZhS23HMDN3ul9ADt9cIeo6-sDuL3GVDiA3e55HT3viKpf3AM6xRALVVhNbFxUnq1-kfrb6jzyFrOfwfCge4TrvFHlToPH1_I-zMeH84N3pAvBQKw3LBtSFNTwpMzLmJrSWiMdZ9ZjSsmZobz0AMLELjD4ZFZILqxlRnhISeOceaCW7sH2crV0DyAqXJpzV1jlCpoZb5dRJJeTokwlp7lQQ3jZt4W2HT05Rsk402GbnAmNVaex6rRiQ3h6kfq8peX4S7p4vVl1E5ZByjZmiU6vzrIXmv7iu1mm_CCn6BD2e13QXUevNRUewKUZp3IIz3r9WHt9xQ8e_nuZHsEtf8VbR8t92G6qH-4x3LA_m-91NYJrYvYZ5ckXlAsxgutvDyfTmb97L4iXH-MDlMknlOLIyyn76uXs6HgUes5vYvEQzQ |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT9VAFL1BNCILkSfEp6hdiJGYkU4_5mNhjEEJhOcLixfDbtL5qErI67OtEH6U_5GZaQceBt2xcNt2pml75s6dO6fnALySRcoSLinizMQoK9IYSWk40gnWMmaUSb_R_nVEx2N2dMQPF-B3-BfG0SpDTPSBWlfK1ci3MbUzZZoRzD7MfiLnGuV2V4OFRgeLA3N-Zpdszfv9T_b7bibJ7ufJzh7qXQWQsmulFmmNJUnKooyxLJWSzJBc2TSJkVxiUto5UcbGi9JkijJClcoltVkSjovc5h6p7fYO3M0yOxocUzDeudL4jb2PiNNsQzlhSc-ztxnR9nFVO21wnL9zRhZzM-A1fdTAibyW7f6xQevnvd2V_-yNPYKHfYIdfexGxCosmOkA7gd-_wBWgo9F1Ie1ASzPiTIOYLU_3kRvek3urceAD52bRO0Lp62JypPqDDXfq1nUWNBrx-b_FrmSdlSbY09um67B5Daech0Wp9XUPIFIm7QgRituNM6kXYJip6PHaJkyggvKh_A2AECoXondGYKcCM8IyKlwcBEOLoLnQ9i8vHrWKZD85bp4Hkui9RWfsrNnEenNTdY93i77zTJu4znHQ9gIkBJ9TGvEFZ6G8DqAcu70DTd4-u9-XsLS3uTLSIz2xwfP4IFtRDou6QYstvUv8xzuqdP2R1O_8AMtAnHLML0AJChh2g |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwFHwqBVVwoHShYtsCPlAEqszGSfyRA0KIsqLaarWHCvVmxY4DVNVmSUIrfhr_rrbjtFtUuPXANYkdJRm_92xPZgBeqjwRcaY4zoSJcJonEVbKZLiISaEiwYXyG-1fDvl0Ko6Ps9kK_O7_hXG0yj4m-kBdVNqtkY8It5kySRkRozLQImb74_eLH9g5SLmd1t5Oo4PIxPw6t9O35t3Bvv3Wu3E8_nT08TMODgNY23lTi4uCKBaXeRkRVWqthGFU25JJMKoIK21-VJHxAjWp5oJxranitmIiUU5tHZLYbu_AXZuEqRtiE46v9H4j7yni9NswZSIOnHtbHY1OqtrphBP61plaLGXDa1qpPT_yWuX7x2atz4Hj9f_47T2Ch6HwRh-6kbIBK2Y-gLWe9z-A9d7fAoVwN4AHS2KNA9gIxxv0Omh1v3kMZOZcJmq_oNoaVJ5W57j5Vi1QYwdD4Vj-X5Fb6ka1OfGkt_kTOLqNp9yE1Xk1N08BFSbJmSl0ZgqSKjs1JU5fT_AyEYzkPBvCXg8GqYNCuzMKOZWeKUC5dNCRDjoyo0PYvbx60SmT_OW6aBlXsvUrQWVn2yKTm5tseuxd9pummY3zGRnCTg8vGWJdI6-wNYRXPUCXTt9wg61_9_MC1iw65eHBdLIN920b1lFMd2C1rX-aZ3BPn7Xfm_q5H3MI5C2j9ALE-WqA |
| 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=Proportionate+flow-shop+scheduling+with+rejection&rft.jtitle=The+Journal+of+the+Operational+Research+Society&rft.au=Shabtay%2C+Dvir&rft.au=Oron%2C+Daniel&rft.date=2016-05-01&rft.pub=Taylor+%26+Francis&rft.issn=0160-5682&rft.eissn=1476-9360&rft.volume=67&rft.issue=5&rft.spage=752&rft.epage=769&rft_id=info:doi/10.1057%2Fjors.2015.95&rft.externalDocID=11944527 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0160-5682&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0160-5682&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0160-5682&client=summon |