Single machine scheduling and due date assignment with positionally dependent processing times

We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due da...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 198; no. 1; pp. 57 - 62
Main Authors:	Gordon, Valery S., Strusevich, Vitaly A.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.10.2009 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Applied sciences Assignment problem Common due date assignment Deadlines Dynamic programming Exact sciences and technology Inventory control, production control. Distribution Job shops Logistics Mathematical programming Operational research and scientific management Operational research. Management science Optimization algorithms Positionally dependent processing times Production scheduling Scheduling, sequencing Single machine scheduling Single machine scheduling Common due date assignment SLK due date assignment Positionally dependent processing times SLK due date assignment Studies Positionally dependent processing times Common due date assignment SLK due date assignment Single machine scheduling Processing time Scheduling Polynomial method Modeling Due date Polynomial time Time dependence Cooperation Cost function Matrix polynomial Earliness Objective function Dynamic programming Single machine Logistics Mathematical programming Execution time
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling.
AbstractList	We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling. We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling. [PUBLICATION ABSTRACT]
Author	Gordon, Valery S. Strusevich, Vitaly A.
Author_xml	– sequence: 1 givenname: Valery S. surname: Gordon fullname: Gordon, Valery S. email: gordon@newman.bas-net.by organization: United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganov Street 6, Minsk 220012, Belarus – sequence: 2 givenname: Vitaly A. surname: Strusevich fullname: Strusevich, Vitaly A. email: V.Strusevich@greenwich.ac.uk, V.Strusevich@gre.ac.uk organization: School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London SE10 9LS, UK
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21496099$$DView record in Pascal Francis http://econpapers.repec.org/article/eeeejores/v_3a198_3ay_3a2009_3ai_3a1_3ap_3a57-62.htm$$DView record in RePEc
BookMark	eNp9UU1r3DAQFSWFbtL-gZ5MoUc7klayLOilhH4EAj20vVbI0jgrY8uupE3Zf98xm_aQQwSjgdF7T483l-QiLhEIectowyhrr8cGxiU1nNKuoaqhQrwgO9YpXrddSy_Iju6Vqjln6hW5zHmklDLJ5I78-h7i_QTVbN0hRKiyO4A_TjisbPSVP0LlbYHK5hzu4wyxVH9COVTrkkMJS7TTdKo8rBD99ramxQFCkV7CDPk1eTnYKcObx35Ffn7-9OPma3337cvtzce72gkpSs17LnvpoLe0E4OiqvVs76WQWinoHVW2xXuwcuh1R4Wi3Ak9aGR4PfRO7K_Iu7MuGvh9hFzMuBwTusuGU8GEVJoh6PYMSujXmTWF2aaTATwYHmTzYPaW6Q7vExaGqbGFbYi1YkllWm4OZUat948f2uzsNCQbXcj_NTkTuqVaI64741xack4wGBeK3ZIryYbJMGq2BZrRbB7MtkBDlcEFIpU_of5Tf5b04UwCTPshQDLZBYgYVEjgivFLeI7-F5e-uAI
CODEN	EJORDT
CitedBy_id	crossref_primary_10_1080_00207543_2017_1355576 crossref_primary_10_1016_j_apm_2012_01_022 crossref_primary_10_1016_j_cie_2011_01_017 crossref_primary_10_1016_j_ejor_2012_04_037 crossref_primary_10_1007_s10878_018_0365_8 crossref_primary_10_3138_infor_48_3_171 crossref_primary_10_1080_00207543_2017_1394587 crossref_primary_10_1016_j_ejor_2012_11_060 crossref_primary_10_1016_j_camwa_2010_09_005 crossref_primary_10_4028_www_scientific_net_AMR_605_607_521 crossref_primary_10_1016_j_asoc_2015_01_069 crossref_primary_10_1016_j_ins_2013_06_035 crossref_primary_10_1080_00207543_2023_2179342 crossref_primary_10_1057_jors_2012_161 crossref_primary_10_1016_j_omega_2011_12_007 crossref_primary_10_1080_00207543_2014_886027 crossref_primary_10_1080_00207543_2014_886025 crossref_primary_10_1016_j_ejor_2014_09_043 crossref_primary_10_1016_j_cie_2012_02_015 crossref_primary_10_1016_j_amc_2013_05_045 crossref_primary_10_1016_j_apm_2009_07_002 crossref_primary_10_1155_2014_620150 crossref_primary_10_1016_j_ejor_2010_09_042 crossref_primary_10_1080_00207543_2022_2049911 crossref_primary_10_1016_j_amc_2014_11_011 crossref_primary_10_1016_j_cie_2020_106799 crossref_primary_10_1080_00207543_2023_2245919 crossref_primary_10_1016_j_cor_2012_11_013 crossref_primary_10_1057_jors_2012_47 crossref_primary_10_1016_j_apm_2013_10_022 crossref_primary_10_1080_10556788_2014_969262 crossref_primary_10_4028_www_scientific_net_AMM_197_619 crossref_primary_10_1016_j_ejor_2022_03_043 crossref_primary_10_1155_2019_1572614 crossref_primary_10_1016_j_cor_2010_01_009 crossref_primary_10_1016_j_cor_2017_02_010 crossref_primary_10_1007_s00170_013_5263_8 crossref_primary_10_1155_2014_367152 crossref_primary_10_1080_00207721_2013_815826 crossref_primary_10_1080_02522667_2017_1367515 crossref_primary_10_1016_j_asoc_2021_108023 crossref_primary_10_1007_s10288_016_0333_z crossref_primary_10_4028_www_scientific_net_AMM_26_28_870 crossref_primary_10_1016_j_cie_2017_07_018 crossref_primary_10_4028_www_scientific_net_AMM_635_637_1884 crossref_primary_10_1007_s00170_010_2988_5 crossref_primary_10_1080_00207543_2015_1056317 crossref_primary_10_1080_00207543_2017_1321804 crossref_primary_10_1007_s10951_011_0240_2 crossref_primary_10_1016_j_omega_2016_02_005 crossref_primary_10_1080_00207543_2023_2280998 crossref_primary_10_1016_j_cie_2020_106858 crossref_primary_10_1016_j_asoc_2016_09_051 crossref_primary_10_1080_00207543_2013_855833 crossref_primary_10_38016_jista_767154 crossref_primary_10_1016_j_ijpe_2010_08_017 crossref_primary_10_1080_0305215X_2016_1227616 crossref_primary_10_1016_j_apm_2011_02_023 crossref_primary_10_1016_j_ijpe_2011_02_029
Cites_doi	10.1016/S0377-2217(02)00909-8 10.1111/j.1540-5915.1991.tb00353.x 10.1016/0166-218X(93)90088-6 10.1287/msom.1060.0139 10.1057/palgrave.jors.2601856 10.1016/j.dam.2005.04.019 10.1016/S0377-2217(00)00175-2 10.1016/S0377-2217(98)00246-X 10.1016/j.mcm.2004.09.004 10.1007/s10951-008-0064-x 10.1016/j.ejor.2005.03.020 10.1287/opre.51.4.566.16106 10.1007/BF02936581
ContentType	Journal Article
Copyright	2008 Elsevier B.V. 2009 INIST-CNRS Copyright Elsevier Sequoia S.A. Oct 1, 2009
Copyright_xml	– notice: 2008 Elsevier B.V. – notice: 2009 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Oct 1, 2009
DBID	AAYXX CITATION IQODW DKI X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D
DOI	10.1016/j.ejor.2008.07.044
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
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business Applied Sciences
EISSN	1872-6860
EndPage	62
ExternalDocumentID	1666830141 eeeejores_v_3a198_3ay_3a2009_3ai_3a1_3ap_3a57_62_htm 21496099 10_1016_j_ejor_2008_07_044 S0377221708006917
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- 9DU 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 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 AFXIZ AGCQF AGRNS FR3 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c454t-2b25b5ceba084f7076d13d545977ebc07a6bc0fa5fb9804702c49f95ced9fbc43
ISICitedReferencesCount	64
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000265341200007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0377-2217
IngestDate	Fri Jul 25 02:45:06 EDT 2025 Wed Aug 18 03:50:56 EDT 2021 Wed Apr 02 07:25:36 EDT 2025 Tue Nov 18 22:14:39 EST 2025 Sat Nov 29 01:40:56 EST 2025 Fri Feb 23 02:27:49 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Positionally dependent processing times Common due date assignment SLK due date assignment Single machine scheduling Processing time Scheduling Polynomial method Modeling Due date Polynomial time Time dependence Cooperation Cost function Matrix polynomial Earliness Objective function Dynamic programming Single machine Logistics Mathematical programming Execution time
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c454t-2b25b5ceba084f7076d13d545977ebc07a6bc0fa5fb9804702c49f95ced9fbc43
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
PQID	204145791
PQPubID	45678
PageCount	6
ParticipantIDs	proquest_journals_204145791 repec_primary_eeeejores_v_3a198_3ay_3a2009_3ai_3a1_3ap_3a57_62_htm pascalfrancis_primary_21496099 crossref_citationtrail_10_1016_j_ejor_2008_07_044 crossref_primary_10_1016_j_ejor_2008_07_044 elsevier_sciencedirect_doi_10_1016_j_ejor_2008_07_044
PublicationCentury	2000
PublicationDate	2009-10-01
PublicationDateYYYYMMDD	2009-10-01
PublicationDate_xml	– month: 10 year: 2009 text: 2009-10-01 day: 01
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationSeriesTitle	European Journal of Operational Research
PublicationTitle	European journal of operational research
PublicationYear	2009
Publisher	Elsevier B.V Elsevier Elsevier Sequoia S.A
Publisher_xml	– name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A
References	Wang (bib15) 2005; 18 Gordon, Proth, Strusevich (bib5) 2004 Kahlbacher, Cheng (bib8) 1993; 47 Kuo, Yang (bib10) 2006; 174 Karp (bib9) 1972 Wang, Xia (bib16) 2005; 56 Shabtay, Steiner (bib14) 2007; 9 Cheng, Ding, Lin (bib3) 2004; 152 Agnetis, Hall, Pacciarelli (bib1) 2006; 154 . Biskup (bib2) 1999; 115 Mosheiov (bib12) 2005; 41 Gordon, V.S., Potts, C.N., Strusevich, V.A., Whitehead, J.D., in press. Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation. Journal of Scheduling. Pinedo (bib13) 2005 Mosheiov (bib11) 2001; 132 De, Ghosh, Wells (bib4) 1991; 22 Hall, Potts (bib7) 2003; 51 Cheng (10.1016/j.ejor.2008.07.044_bib3) 2004; 152 Kahlbacher (10.1016/j.ejor.2008.07.044_bib8) 1993; 47 Gordon (10.1016/j.ejor.2008.07.044_bib5) 2004 Hall (10.1016/j.ejor.2008.07.044_bib7) 2003; 51 Biskup (10.1016/j.ejor.2008.07.044_bib2) 1999; 115 Karp (10.1016/j.ejor.2008.07.044_bib9) 1972 Shabtay (10.1016/j.ejor.2008.07.044_bib14) 2007; 9 Pinedo (10.1016/j.ejor.2008.07.044_bib13) 2005 Mosheiov (10.1016/j.ejor.2008.07.044_bib11) 2001; 132 Kuo (10.1016/j.ejor.2008.07.044_bib10) 2006; 174 10.1016/j.ejor.2008.07.044_bib6 Agnetis (10.1016/j.ejor.2008.07.044_bib1) 2006; 154 De (10.1016/j.ejor.2008.07.044_bib4) 1991; 22 Wang (10.1016/j.ejor.2008.07.044_bib15) 2005; 18 Mosheiov (10.1016/j.ejor.2008.07.044_bib12) 2005; 41 Wang (10.1016/j.ejor.2008.07.044_bib16) 2005; 56
References_xml	– volume: 41 start-page: 883 year: 2005 end-page: 886 ident: bib12 article-title: A note on scheduling deteriorating jobs publication-title: Mathematical and Computer Modelling – volume: 174 start-page: 1184 year: 2006 end-page: 1190 ident: bib10 article-title: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect publication-title: European Journal of Operational Research – volume: 56 start-page: 1325 year: 2005 end-page: 1330 ident: bib16 article-title: Flow shop scheduling with a learning effect publication-title: Journal of the Operational Research Society – start-page: 21-1 year: 2004 end-page: 21-22 ident: bib5 article-title: Scheduling with due date assignment publication-title: Handbook of Scheduling: Algorithms, Models and Performance Analysis – volume: 47 start-page: 139 year: 1993 end-page: 164 ident: bib8 article-title: Parallel machine scheduling to minimize costs for earliness and number of tardy jobs publication-title: Discrete Applied Mathematics – year: 2005 ident: bib13 article-title: Planning and Scheduling in Manufacturing and Services – reference: Gordon, V.S., Potts, C.N., Strusevich, V.A., Whitehead, J.D., in press. Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation. Journal of Scheduling. – volume: 115 start-page: 173 year: 1999 end-page: 178 ident: bib2 article-title: Single-machine scheduling with learning considerations publication-title: European Journal of Operational Research – volume: 154 start-page: 2044 year: 2006 end-page: 2063 ident: bib1 article-title: Supply chain scheduling: Sequence coordination publication-title: Discrete Applied Mathematics – start-page: 85 year: 1972 end-page: 103 ident: bib9 article-title: Reducibility among combinatorial problems publication-title: Complexity of Computer Computations – volume: 18 start-page: 383 year: 2005 end-page: 391 ident: bib15 article-title: Flow shop scheduling jobs with position-dependent processing times publication-title: Journal of Applied Mathematics and Computing – volume: 132 start-page: 687 year: 2001 end-page: 693 ident: bib11 article-title: Scheduling problems with a learning effect publication-title: European Journal of Operational Research – volume: 22 start-page: 379 year: 1991 end-page: 390 ident: bib4 article-title: Optimal delivery time quotation and order sequencing publication-title: Decision Science – volume: 9 start-page: 332 year: 2007 end-page: 350 ident: bib14 article-title: Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine publication-title: Manufacturing and Service Operations Management – volume: 51 start-page: 566 year: 2003 end-page: 584 ident: bib7 article-title: Supply chain scheduling: Batching and delivery publication-title: Operations Research – reference: . – volume: 152 start-page: 1 year: 2004 end-page: 13 ident: bib3 article-title: A concise survey of scheduling with time-dependent processing times publication-title: European Journal of Operational Research – volume: 152 start-page: 1 year: 2004 ident: 10.1016/j.ejor.2008.07.044_bib3 article-title: A concise survey of scheduling with time-dependent processing times publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00909-8 – volume: 22 start-page: 379 year: 1991 ident: 10.1016/j.ejor.2008.07.044_bib4 article-title: Optimal delivery time quotation and order sequencing publication-title: Decision Science doi: 10.1111/j.1540-5915.1991.tb00353.x – volume: 47 start-page: 139 year: 1993 ident: 10.1016/j.ejor.2008.07.044_bib8 article-title: Parallel machine scheduling to minimize costs for earliness and number of tardy jobs publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(93)90088-6 – volume: 9 start-page: 332 year: 2007 ident: 10.1016/j.ejor.2008.07.044_bib14 article-title: Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine publication-title: Manufacturing and Service Operations Management doi: 10.1287/msom.1060.0139 – volume: 56 start-page: 1325 year: 2005 ident: 10.1016/j.ejor.2008.07.044_bib16 article-title: Flow shop scheduling with a learning effect publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601856 – volume: 154 start-page: 2044 year: 2006 ident: 10.1016/j.ejor.2008.07.044_bib1 article-title: Supply chain scheduling: Sequence coordination publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2005.04.019 – volume: 132 start-page: 687 year: 2001 ident: 10.1016/j.ejor.2008.07.044_bib11 article-title: Scheduling problems with a learning effect publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(00)00175-2 – year: 2005 ident: 10.1016/j.ejor.2008.07.044_bib13 – volume: 115 start-page: 173 year: 1999 ident: 10.1016/j.ejor.2008.07.044_bib2 article-title: Single-machine scheduling with learning considerations publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00246-X – volume: 41 start-page: 883 year: 2005 ident: 10.1016/j.ejor.2008.07.044_bib12 article-title: A note on scheduling deteriorating jobs publication-title: Mathematical and Computer Modelling doi: 10.1016/j.mcm.2004.09.004 – start-page: 21-1 year: 2004 ident: 10.1016/j.ejor.2008.07.044_bib5 article-title: Scheduling with due date assignment – ident: 10.1016/j.ejor.2008.07.044_bib6 doi: 10.1007/s10951-008-0064-x – volume: 174 start-page: 1184 year: 2006 ident: 10.1016/j.ejor.2008.07.044_bib10 article-title: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.03.020 – volume: 51 start-page: 566 year: 2003 ident: 10.1016/j.ejor.2008.07.044_bib7 article-title: Supply chain scheduling: Batching and delivery publication-title: Operations Research doi: 10.1287/opre.51.4.566.16106 – start-page: 85 year: 1972 ident: 10.1016/j.ejor.2008.07.044_bib9 article-title: Reducibility among combinatorial problems – volume: 18 start-page: 383 year: 2005 ident: 10.1016/j.ejor.2008.07.044_bib15 article-title: Flow shop scheduling jobs with position-dependent processing times publication-title: Journal of Applied Mathematics and Computing doi: 10.1007/BF02936581
SSID	ssj0001515
Score	2.2362626
Snippet	We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence....
SourceID	proquest repec pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	57
SubjectTerms	Applied sciences Assignment problem Common due date assignment Deadlines Dynamic programming Exact sciences and technology Inventory control, production control. Distribution Job shops Logistics Mathematical programming Operational research and scientific management Operational research. Management science Optimization algorithms Positionally dependent processing times Production scheduling Scheduling, sequencing Single machine scheduling Single machine scheduling Common due date assignment SLK due date assignment Positionally dependent processing times SLK due date assignment Studies
Title	Single machine scheduling and due date assignment with positionally dependent processing times
URI	https://dx.doi.org/10.1016/j.ejor.2008.07.044 http://econpapers.repec.org/article/eeeejores/v_3a198_3ay_3a2009_3ai_3a1_3ap_3a57-62.htm https://www.proquest.com/docview/204145791
Volume	198
WOSCitedRecordID	wos000265341200007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZKixAIcSlMlMHkB96iVKljx_FjQeP2MCFtTH3CihMHWoWuartq_QP8bo5jO21XmACJSnErq07Snu_4XHIuCL0iMTVqaBLqmOQh1UUSpkqJEFRdEGgZKNFM1c0m-MlJOhqJT63WD58Ls6r4dJpeXYnZfyU1zAGxTersX5C7OSlMwGcgOoxAdhj_iPCnIIwqE5ZqoiR1ANYrSJPK5yIWlzowRn4ASvP4qw0FqH2xPnorq6p14FvjLoOZTSSok6qabJFfefKdVgsTc-9fdIWEGofzOzB07UP-cxBLc9i1-o2Dx-R-gIy2janOTSeTdTDs7_gkRBPd5hxle8kyNkGL85AQm6rZ13a_TTkJk9S2FGg2ZJHuIc9ur4xvCWq7i--JAOuNmPT15GLuYmV5P7JFJq-V1j41t2TuyKjNCRiut1CHcCbSNuoMPxyPPjYy3ah99fMo9xNc-pWNFLx-pd-pOPdn2QIYr7QdU3ZMms4c6JpvaTZnj9ADZ5LgoYXSY9TS0y664zMiuuih7_yBnSDoontbZSyfoC8WcthBDm8ghwFyGCCHDQ3xBnLYQA5vQw43kMMbyOEack_R57fHZ2_eh65vR5hTRpchUYQplmsFrE5LHvGkGMQFqOpga2iVRzxLYCwzViqRRpRHJKeiFLCiEKXKaXyA2tOLqX6GMC14pnhcaJVmtCRlmmRCMB2ZMGIw3HkPDfxfLXNX1N70Vqmkj16cSEMe122VSyBPDwXNmpkt6XLjt5mnoHRKqVU2JQDuxnVHO-RuLkUG1FR5FD106OkvHZsu4AR0QBkXgx56XUOiWabhBZfQC7mScQYsAuMaDsN-8DY2k3DM4GBcJkR-W35__o_3fojubrj6BWrDFqBfotv5ajlezI8cb_wEn1vgig
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Single+machine+scheduling+and+due+date+assignment+with+positionally+dependent+processing+times&rft.jtitle=European+journal+of+operational+research&rft.au=Gordon%2C+Valery+S.&rft.au=Strusevich%2C+Vitaly+A.&rft.date=2009-10-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=198&rft.issue=1&rft.spage=57&rft.epage=62&rft_id=info:doi/10.1016%2Fj.ejor.2008.07.044&rft.externalDocID=S0377221708006917
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