SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES

We consider a non-preemptive single machine scheduling problem with forbidden intervals. Associated with each job is a given processing time and a delivery time to its customer, when the processing of the job is complete. The objective is to minimize the time taken for all the jobs to be delivered t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Asia-Pacific journal of operational research Ročník 25; číslo 3; s. 317 - 325
Hlavní autoři: YUAN, JINJIANG, SHI, LEI, OU, JINWEN
Médium: Journal Article
Jazyk:angličtina
Vydáno: Singapore World Scientific Publishing Co, & Operational Research Society of Singapore 01.06.2008
World Scientific Publishing Co. Pte., Ltd
Témata:
Approximation
Deliveries
Job shops
Machinery
Operations research
Scheduling algorithms
Studies
polynomial time approximation algorithms
performance ratio
PTAS
Forbidden intervals
delivery times
ISSN:0217-5959, 1793-7019, 0217-5959
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We consider a non-preemptive single machine scheduling problem with forbidden intervals. Associated with each job is a given processing time and a delivery time to its customer, when the processing of the job is complete. The objective is to minimize the time taken for all the jobs to be delivered to the customers. The problem is strongly NP-hard in general. In this study, we show that the case with a fixed number of forbidden intervals can be solved by a pseudo-polynomial time algorithm, while no polynomial time approximation algorithm with a fixed performance ratio exists for the case with two forbidden intervals. We also develop a polynomial time approximation scheme (PTAS) for the case with a single forbidden interval.
AbstractList We consider a non-preemptive single machine scheduling problem with forbidden intervals. Associated with each job is a given processing time and a delivery time to its customer, when the processing of the job is complete. The objective is to minimize the time taken for all the jobs to be delivered to the customers. The problem is strongly NP-hard in general. In this study, we show that the case with a fixed number of forbidden intervals can be solved by a pseudo-polynomial time algorithm, while no polynomial time approximation algorithm with a fixed performance ratio exists for the case with two forbidden intervals. We also develop a polynomial time approximation scheme (PTAS) for the case with a single forbidden interval.
We consider a non-preemptive single machine scheduling problem with forbidden intervals. Associated with each job is a given processing time and a delivery time to its customer, when the processing of the job is complete. The objective is to minimize the time taken for all the jobs to be delivered to the customers. The problem is strongly NP-hard in general. In this study, we show that the case with a fixed number of forbidden intervals can be solved by a pseudo-polynomial time algorithm, while no polynomial time approximation algorithm with a fixed performance ratio exists for the case with two forbidden intervals. We also develop a polynomial time approximation scheme (PTAS) for the case with a single forbidden interval. [PUBLICATION ABSTRACT]
Author YUAN, JINJIANG
OU, JINWEN
SHI, LEI
Author_xml – sequence: 1
  givenname: JINJIANG
  surname: YUAN
  fullname: YUAN, JINJIANG
  email: yuanjj@zzu.edu.cn
  organization: Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China
– sequence: 2
  givenname: LEI
  surname: SHI
  fullname: SHI, LEI
  organization: Department of Mathematics, Anyang Normal University, Anyang, Henan 455000, China
– sequence: 3
  givenname: JINWEN
  surname: OU
  fullname: OU, JINWEN
  organization: Department of Administrative Management, Jinan University, Guangzhou, Guangdong 510632, China
BookMark eNp9kMFLwzAYxYNMcJv-Ad6C92qStUl67NZsjXQdrN3EU8nSBDpmO9sO8b-3Y-JBwdMH773f9-CNwKCqKwPAPUaPGLvkKUUEM8_3fMQRwozxKzDEzJ84DGF_AIZn2zn7N2DUtnvUhzxChkCmMlnEAi6DWSQTAdNZJMJN3IvwRWYRnK_WUxmGIoEyycR6G8QpDJIQPq-mMBSx3Ir1K8zkUqS34NqqQ2vuvu8YbOYim0VOvFrIWRA72sWEO5ZY5hWKTnxGPUN21tfYYMOZMbYg1CrMCm0U96imO-UjyxGmllNWuMxVVE_G4OHy99jU7yfTdvm-PjVVX5kT5DKKOCF9CF9CuqnbtjE2Pzblm2o-c4zy82D5n8F6hv1idNmprqyrrlHl4V8SXciPujkUrS5N1ZW21D-lf5EvK3541Q
CODEN APJRE3
CitedBy_id crossref_primary_10_1007_s00453_018_0417_6
crossref_primary_10_1007_s10878_015_9924_4
crossref_primary_10_1016_j_ejor_2013_07_032
crossref_primary_10_1016_j_tcs_2014_10_047
crossref_primary_10_1007_s10878_007_9102_4
crossref_primary_10_1007_s10878_020_00572_6
crossref_primary_10_1007_s10878_022_00890_x
crossref_primary_10_1016_j_amc_2014_11_103
crossref_primary_10_1007_s10288_008_0076_6
Cites_doi 10.1007/978-3-662-04550-3
10.1007/BF00121681
10.1016/j.ejor.2003.10.043
10.1057/palgrave.jors.2601998
10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
10.15807/jorsj.22.205
10.1016/j.dam.2006.06.005
10.1080/07408170304416
10.1016/S0927-0507(05)80189-6
10.1002/nav.20083
10.1057/palgrave.jors.2600791
10.1016/S0377-2217(98)00367-1
10.1016/S0167-5060(08)70356-X
10.1002/(SICI)1099-1425(199911/12)2:6<267::AID-JOS31>3.0.CO;2-H
10.1002/nav.10045
10.1287/opre.31.2.381
10.1023/A:1026272526225
10.1007/BF00288977
10.1016/j.ejor.2003.08.026
10.1016/S0377-2217(00)00322-2
10.1016/S0377-2217(03)00232-7
10.1287/moor.17.1.22
ContentType Journal Article
Copyright 2008, World Scientific Publishing Co, & Operational Research Society of Singapore
Copyright World Scientific Publishing Co. Pte., Ltd. Jun 2008
Copyright_xml – notice: 2008, World Scientific Publishing Co, & Operational Research Society of Singapore
– notice: Copyright World Scientific Publishing Co. Pte., Ltd. Jun 2008
DBID AAYXX
CITATION
3V.
4T-
7RO
7WY
7WZ
7XB
87Z
8AI
8AL
8AO
8FE
8FG
8FK
8FL
ABUWG
AFKRA
ARAPS
AXJJW
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FREBS
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
M0C
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
Q9U
S0X
DOI 10.1142/S0217595908001778
DatabaseName CrossRef
ProQuest Central (Corporate)
Docstoc
Asian Business Database
ProQuest ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Asian Business Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
Asian & European Business Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central Korea
Asian & European Business Collection (Alumni)
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ABI/INFORM Global (OCUL)
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
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 Basic
SIRS Editorial
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Asian Business & Reference
SIRS Editorial
ProQuest Computer Science Collection
Asian & European Business Collection
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Pharma Collection
ABI/INFORM Complete
Asian & European Business Collection (Alumni)
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ProQuest Asian Business and Reference (Alumni Edition)
ProQuest Central Korea
ProQuest Central (New)
ABI/INFORM Complete (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Docstoc
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
Business Premium Collection (Alumni)
DatabaseTitleList CrossRef

ABI/INFORM Global (Corporate)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Business
EISSN 1793-7019
0217-5959
EndPage 325
ExternalDocumentID 1561363041
10_1142_S0217595908001778
S0217595908001778
Genre Feature
GroupedDBID 0R~
23N
3V.
4.4
5GY
7RO
7WY
8AI
8AO
8FE
8FG
8FL
8R4
8R5
8VB
ABPPZ
ABTAH
ABUWG
ADSJI
AENEX
AFKRA
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ARAPS
AXJJW
AZQEC
BENPR
BEZIV
BGLVJ
BKOMP
BPHCQ
CAG
CCPQU
COF
CS3
DWQXO
EBS
EBU
EJD
FAL
FJD
FJW
FRNLG
GNUQQ
GROUPED_ABI_INFORM_COMPLETE
HCIFZ
HZ~
K1G
K60
K6V
K6~
K7-
M0C
M0N
O9-
P2P
P62
P71
PQBIZ
PQBZA
PQQKQ
PROAC
Q2X
QWB
RWJ
RWL
RXW
S0X
TAE
TN5
ZL0
ZY4
~02
AAYXX
AFFHD
AHQJS
AMVHM
CITATION
PHGZM
PHGZT
PQGLB
4T-
7XB
8AL
8FK
JQ2
L.-
PKEHL
PQEST
PQUKI
Q9U
ID FETCH-LOGICAL-c4128-f2f75da639765e2bf9c1e1e87eefd26fa17dcea856c6ba90f8016f867d474a6c3
IEDL.DBID M0C
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258297200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0217-5959
IngestDate Sat Aug 23 14:50:18 EDT 2025
Sat Nov 29 03:34:26 EST 2025
Tue Nov 18 21:40:49 EST 2025
Fri Aug 23 08:19:18 EDT 2024
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords polynomial time approximation algorithms
performance ratio
PTAS
Forbidden intervals
delivery times
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c4128-f2f75da639765e2bf9c1e1e87eefd26fa17dcea856c6ba90f8016f867d474a6c3
Notes Project partially supported by NSFC (10671183).
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 204760822
PQPubID 30752
PageCount 9
ParticipantIDs crossref_primary_10_1142_S0217595908001778
proquest_journals_204760822
worldscientific_primary_S0217595908001778
crossref_citationtrail_10_1142_S0217595908001778
PublicationCentury 2000
PublicationDate 20080600
PublicationDateYYYYMMDD 2008-06-01
PublicationDate_xml – month: 06
  year: 2008
  text: 20080600
PublicationDecade 2000
PublicationPlace Singapore
PublicationPlace_xml – name: Singapore
PublicationTitle Asia-Pacific journal of operational research
PublicationYear 2008
Publisher World Scientific Publishing Co, & Operational Research Society of Singapore
World Scientific Publishing Co. Pte., Ltd
Publisher_xml – name: World Scientific Publishing Co, & Operational Research Society of Singapore
– name: World Scientific Publishing Co. Pte., Ltd
References rf5
rf12
rf23
rf4
rf22
rf7
rf25
rf6
rf13
rf24
rf9
rf10
rf21
rf20
Garey M. R. (rf8) 1979
rf19
rf16
rf18
rf17
Kise H. (rf15); 22
rf1
rf3
rf2
References_xml – ident: rf5
  doi: 10.1007/978-3-662-04550-3
– ident: rf17
  doi: 10.1007/BF00121681
– ident: rf25
  doi: 10.1016/j.ejor.2003.10.043
– ident: rf7
  doi: 10.1057/palgrave.jors.2601998
– ident: rf10
  doi: 10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
– volume: 22
  start-page: 205
  ident: rf15
  publication-title: Journal of Operation Research Society Japan
  doi: 10.15807/jorsj.22.205
– ident: rf20
  doi: 10.1016/j.dam.2006.06.005
– ident: rf6
  doi: 10.1080/07408170304416
– ident: rf16
  doi: 10.1016/S0927-0507(05)80189-6
– ident: rf13
  doi: 10.1002/nav.20083
– ident: rf21
  doi: 10.1057/palgrave.jors.2600791
– ident: rf24
  doi: 10.1016/S0377-2217(98)00367-1
– ident: rf9
  doi: 10.1016/S0167-5060(08)70356-X
– ident: rf23
  doi: 10.1002/(SICI)1099-1425(199911/12)2:6<267::AID-JOS31>3.0.CO;2-H
– ident: rf2
  doi: 10.1002/nav.10045
– ident: rf4
  doi: 10.1287/opre.31.2.381
– ident: rf19
  doi: 10.1023/A:1026272526225
– ident: rf1
  doi: 10.1007/BF00288977
– ident: rf22
  doi: 10.1016/j.ejor.2003.08.026
– ident: rf18
  doi: 10.1016/S0377-2217(00)00322-2
– ident: rf3
  doi: 10.1016/S0377-2217(03)00232-7
– volume-title: Computers and Intractability: A Guide to the Theory of NP-Completeness
  year: 1979
  ident: rf8
– ident: rf12
  doi: 10.1287/moor.17.1.22
SSID ssj0001522
ssib019635130
Score 1.793316
Snippet We consider a non-preemptive single machine scheduling problem with forbidden intervals. Associated with each job is a given processing time and a delivery...
SourceID proquest
crossref
worldscientific
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 317
SubjectTerms Approximation
Deliveries
Job shops
Machinery
Operations research
Scheduling algorithms
Studies
Title SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
URI http://www.worldscientific.com/doi/abs/10.1142/S0217595908001778
https://www.proquest.com/docview/204760822
Volume 25
WOSCitedRecordID wos000258297200003&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 Global
  customDbUrl:
  eissn: 1793-7019
  dateEnd: 20131231
  omitProxy: false
  ssIdentifier: ssj0001522
  issn: 0217-5959
  databaseCode: M0C
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1793-7019
  dateEnd: 20131231
  omitProxy: false
  ssIdentifier: ssj0001522
  issn: 0217-5959
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Asian & European Business Collection
  customDbUrl:
  eissn: 1793-7019
  dateEnd: 20131231
  omitProxy: false
  ssIdentifier: ssj0001522
  issn: 0217-5959
  databaseCode: AXJJW
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/asianeuropeanbusiness
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1793-7019
  dateEnd: 20131231
  omitProxy: false
  ssIdentifier: ssj0001522
  issn: 0217-5959
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest ABI/INFORM Collection
  customDbUrl:
  eissn: 1793-7019
  dateEnd: 20131231
  omitProxy: false
  ssIdentifier: ssj0001522
  issn: 0217-5959
  databaseCode: 7WY
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1793-7019
  dateEnd: 20131231
  omitProxy: false
  ssIdentifier: ssj0001522
  issn: 0217-5959
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dT9swED_xMU17AcaG6NgqP-yFSdGcNLaTpym0Zk1pQ0UKLbxEjmNLk6bCKNvfPztxOjQkXnhJpFN8inz2ffjO9wP4XPpVgENhghxMiBcGKrJJQuXhqBS9njIOPi1rsAmWZdFiEU9dbc7KlVW2OrFW1NWttGfkJkgPGbXtyb_d_fIsaJRNrjoEjU3Yto6Nreib4P5aEfuuWbjxuj0Sk9glNf0w-JpboqVZh8lnFmTtsVn652vu1I1Lm8uJtnbnkfE53X3hb-_BjvM6UdIsk7ewoZb78Lotet-H3RbcAbm9_g7SPM2-jzmaJP1hmnGU94d8cDk2RDRPZ0Nkokej5Qc8Q3VX3atknKMkG6DR-Qka8HF6xS-u0Syd8Pw9XJ7yWX_oOdwFT4bGXHk60IxUwqb8KFFBqWPpK19FTCldBVQLn1VSiYhQSUsRY22sHNURZVXIQkFl7wC2lrdLdQhIMEkYlrLsxcJoBxzrUtlRUkeBCkvcAdxOeyFdU3KLjfGzaC5MB8UTSXXgy3rIXdOR47mPj1qxFG5zroq1TDpw_J941xyfcPrwLKcjeNMUktjjmY-w9XD_W32CV_LPw4_VfRc22fy6C9vJYjSam_cJz6YXhnrGvG69ZM1zSm7-Ao5d5b8
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB5RWhUuvFrULRR8oIdWikgcx04OFVo2oUk3m1bNQuEUHMeWKqGFsrQVP4r_iJ3HgorEjUOvVjyS4_HnGc_jA9gpnQrbhGsnx_Y8i2DpmyChtGy_5K4rtYFPy5psgmWZf3wcfJuDm64WxqRVdphYA3V1LswbuXbSCaOmPfnexS_LkEaZ4GrHoNFoxVBe_9Ue2_RTEurtfY_xQTQexFZLKmAJorHYUlgxr-ImnkU9iUsVCEc60mdSqgpTxR1WCcl9jwpa8sBWGsKp8imrCCOcClfLfQbPieszc6yGzJoBv9M2J9dWvuUFXtAGUR2Cd3MzaMaMgeYwQ-p2_xq8s22X6kapTTGkyRW6d9kdLP9nv2kFllqrGvWbY7AKc3KyBi-7pP41WO7IK1CLZa8gyZPscxqhUX8QJ1mE8kEchYepHkQ_knGMtHesb7EwylDdNfion-aon4Xoy9d9FEZpchR9P0HjZBTlr-HwSda2DvOT84l8A4gz4TFbiNINuEY_O1ClNLOE8rEkpd0Du9vmQrRN1w33x1nRFITj4oFm9ODjbMpF03HksY83OjUoWvCZFjMd6MGHf9RpJvGBpLePStqGhXg8Sgu9C8MNWGySZsxT1CbMX13-lu_ghfhz9XN6uVUfCQSnT61ct3OyPhk
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3PT9swFH5iMKFdgLFN69jAh-2wSRGJm9jJAU1Zk64pJUNLge6UOY4tTZoKo4xpfxr_Hc-NU9CQuHHY1Yqf5Pjz--H3_D6At5VXU9cXGOS4QeD4VIUmSagcN6xEt6vQwWfVnGyC53k4mUSHS3DVvoUxZZWtTpwr6vpUmjtyDNJ9zkx78l1tqyIOk_7Hs1-OIZAyidaWTaNByL76-wejt9leluBWv6O0n457A8cSDDjSR73saKp5UAuT22KBopWOpKc8FXKldE2ZFh6vpRJhwCSrRORqVOdMh4zXPvcFk12U-whWOBp9PFwr8WQ4PFmYAc-2Kkef3wmiILIpVc-nu4UZNGPGXfO4oXi7bRRvPN21edvU5mmkqRy6Zfr66__xT9uANetvk7g5IE9hSU03YbUt99-E9ZbWglgt9wyyIss_j1JyEPcGWZ6SojdIk6MRDpKTbDwgGDejfUvSnMz7CR_Ho4LEeUKGXz6RJB1lx-nXb2ScHaTFczh6kLW9gOXp6VS9BCK4DLgrZdWNBOpFN9KVMrOkDqnyK7cDbrvlpbTt2A0ryM-yeSpOyzso6cCHxZSzphfJfR9vtZAorVqalQs8dOD9P9BaSLwj6dW9knZgFTFV4ibsb8GTpprG3FG9huWL89_qDTyWlxc_Zufb9nwQ-P7Q6LoGpLNIjQ
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=SINGLE+MACHINE+SCHEDULING+WITH+FORBIDDEN+INTERVALS+AND+JOB+DELIVERY+TIMES&rft.jtitle=Asia-Pacific+journal+of+operational+research&rft.au=YUAN%2C+JINJIANG&rft.au=SHI%2C+LEI&rft.au=OU%2C+JINWEN&rft.date=2008-06-01&rft.pub=World+Scientific+Publishing+Co%2C+%26+Operational+Research+Society+of+Singapore&rft.issn=0217-5959&rft.eissn=1793-7019&rft.volume=25&rft.issue=3&rft.spage=317&rft.epage=325&rft_id=info:doi/10.1142%2FS0217595908001778&rft.externalDocID=S0217595908001778
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0217-5959&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0217-5959&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0217-5959&client=summon