Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows

In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows. The performance measure adopted is the minimization of total weighted earliness and tardiness. Since the variant under study is an NP-hard problem for two or more mach...

Full description

Saved in:

Bibliographic Details
Published in:	Arabian journal for science and engineering (2011) Vol. 47; no. 3; pp. 3899 - 3913
Main Authors:	Rolim, Gustavo Alencar, Nagano, Marcelo Seido, Prata, Bruno de Athayde
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022 Springer Nature B.V
Subjects:	Algorithms Engineering Greedy algorithms Heuristic Humanities and Social Sciences multidisciplinary Research Article-Systems Engineering Scheduling Science Windows (computer programs) Machine scheduling Common due window Identical parallel machines Iterated greedy Heuristics Earliness and tardiness
ISSN:	2193-567X, 1319-8025, 2191-4281
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows. The performance measure adopted is the minimization of total weighted earliness and tardiness. Since the variant under study is an NP-hard problem for two or more machines, we develop a family of constructive heuristics, which are comprised of four phases. First, jobs are sequenced according to priority rules. Second, jobs are assigned to machines using a greedy strategy. Third, a local search is performed to find a better distribution of jobs into machines. Fourth, two heuristics are applied for individually sequencing jobs in each machine, namely RN-RGH and RN-SEA. In addition, we also propose an iterated greedy algorithm to improve the solutions of the best performing heuristic. The computational experiments were carried out to prove the ability of these heuristics to find high-quality solutions in acceptable CPU time. More specifically, the RN-SEA family of algorithms stands out as the most efficient for the problem, however, with a higher computational effort. We also confirm that the IG algorithm has the potential for improving existing solutions, specially for problems with two machines and instances with up to 100 jobs in size.
AbstractList	In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows. The performance measure adopted is the minimization of total weighted earliness and tardiness. Since the variant under study is an NP-hard problem for two or more machines, we develop a family of constructive heuristics, which are comprised of four phases. First, jobs are sequenced according to priority rules. Second, jobs are assigned to machines using a greedy strategy. Third, a local search is performed to find a better distribution of jobs into machines. Fourth, two heuristics are applied for individually sequencing jobs in each machine, namely RN-RGH and RN-SEA. In addition, we also propose an iterated greedy algorithm to improve the solutions of the best performing heuristic. The computational experiments were carried out to prove the ability of these heuristics to find high-quality solutions in acceptable CPU time. More specifically, the RN-SEA family of algorithms stands out as the most efficient for the problem, however, with a higher computational effort. We also confirm that the IG algorithm has the potential for improving existing solutions, specially for problems with two machines and instances with up to 100 jobs in size.
Author	Rolim, Gustavo Alencar Nagano, Marcelo Seido Prata, Bruno de Athayde
Author_xml	– sequence: 1 givenname: Gustavo Alencar orcidid: 0000-0002-9314-717X surname: Rolim fullname: Rolim, Gustavo Alencar organization: Department of Production Engineering, São Carlos School of Engineering, University of São Paulo – sequence: 2 givenname: Marcelo Seido orcidid: 0000-0002-0239-1725 surname: Nagano fullname: Nagano, Marcelo Seido email: drnagano@usp.br organization: Department of Production Engineering, São Carlos School of Engineering, University of São Paulo – sequence: 3 givenname: Bruno de Athayde orcidid: 0000-0002-3920-089X surname: Prata fullname: Prata, Bruno de Athayde organization: Department of Industrial Engineering, Federal University of Ceará, Campus do Pici
BookMark	eNp9kMFKJDEQhoO4oKvzAp4Ce-416WTSnaPMujqg7KIregvppHomQ0_iJmnFJ_C1zdjCwh4sKKoO_1d_8X9F-z54QOiEku-UkOY0UcaErEhNKyJqziu5hw5rKmnF65buv--smovm4QDNUnId4S2Tc0rZIXo973sw2T0BvoQxupSdSVh7WxovM0SdweKLCGBf8NmwCtHl9RbngG_NGuw4AF5a8IXSA_6tox4GGPC1NmvnIeHbsduU8zv9Imy3weMbSDm6yfHHCPjeeRue0zH60ushwexjHqG7n-d_FpfV1a-L5eLsqjJMsFxR3lMtBG-MqduOSc2o0YRrMQfS8r63VlhDpWBdJ-eyBm4627cdN7IpZRt2hL5Ndx9j-DuWX9QmjNEXS1ULzko3ghVVPalMDClF6NVjdFsdXxQlape5mjJXJXP1nrmSBWr_g4zLOrvgc9Ru-BxlE5qKj19B_PfVJ9Qba-OaCQ
CitedBy_id	crossref_primary_10_1016_j_cor_2023_106159
Cites_doi	10.1002/nav.20039 10.1016/s0305-0548(00)00008-3 10.1287/opre.38.1.22 10.1016/j.cie.2007.06.012 10.1016/j.ejor.2009.03.039 10.1016/j.ipl.2013.06.013 10.1016/j.cor.2014.08.020 10.1051/ro/2018029 10.1080/09537280110069621 10.1016/j.ejor.2012.12.034 10.1016/j.eswa.2018.12.039 10.1007/s00291-005-0013-4 10.1016/j.ins.2012.10.024 10.1016/j.ejor.2005.12.009 10.1016/j.cie.2016.12.038 10.1007/s10878-021-00714-4 10.1016/j.ejor.2005.11.015 10.1007/s10951-010-0222-9 10.1016/j.cor.2010.09.020 10.1016/s0377-2217(98)00136-2 10.1007/s10878-021-00709-1 10.1080/00207543.2016.1224949 10.1057/jors.2009.179 10.1016/j.eswa.2008.08.033 10.1016/j.ejor.2014.09.043 10.1057/jors.1990.166 10.1016/0895-7177(94)90208-9 10.1016/j.cie.2020.106803 10.1016/j.ejor.2003.10.026 10.1007/s00170-010-2824-y 10.1007/s10288-012-0201-4 10.1016/0377-2217(95)00116-6 10.1007/s10100-021-00740-x 10.1016/s0377-2217(01)00068-6 10.1016/S0167-5060(08)70356-X 10.1016/j.jpdc.2013.03.008
ContentType	Journal Article
Copyright	King Fahd University of Petroleum & Minerals 2021 King Fahd University of Petroleum & Minerals 2021.
Copyright_xml	– notice: King Fahd University of Petroleum & Minerals 2021 – notice: King Fahd University of Petroleum & Minerals 2021.
DBID	AAYXX CITATION
DOI	10.1007/s13369-021-06244-9
DatabaseName	CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	2191-4281
EndPage	3913
ExternalDocumentID	10_1007_s13369_021_06244_9
GrantInformation_xml	– fundername: Conselho Nacional de Desenvolvimento Científico e Tecnológico grantid: 404232/2016-7 funderid: http://dx.doi.org/10.13039/501100003593 – fundername: Conselho Nacional de Desenvolvimento Científico e Tecnológico grantid: 306075/2017-2; 430137/2018-4 funderid: http://dx.doi.org/10.13039/501100003593 – fundername: Conselho Nacional de Desenvolvimento Científico e Tecnológico grantid: 303594/2018-7; 130396/2018-4 funderid: http://dx.doi.org/10.13039/501100003593
GroupedDBID	-EM 0R~ 203 2KG 406 AAAVM AACDK AAHNG AAIAL AAJBT AANZL AARHV AASML AATNV AATVU AAUYE AAYTO AAYZH ABAKF ABDBF ABDZT ABECU ABFTD ABFTV ABJNI ABJOX ABKCH ABMQK ABQBU ABSXP ABTEG ABTKH ABTMW ABXPI ACAOD ACBXY ACDTI ACHSB ACMDZ ACMLO ACOKC ACPIV ACUHS ACZOJ ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEJRE AEMSY AEOHA AESKC AEVLU AEXYK AFBBN AFLOW AFQWF AGAYW AGJBK AGMZJ AGQEE AGQMX AGRTI AHAVH AHBYD AHSBF AIAKS AIGIU AILAN AITGF AJBLW AJRNO AJZVZ ALFXC ALMA_UNASSIGNED_HOLDINGS AMXSW AMYLF AOCGG AXYYD BGNMA CSCUP DDRTE DNIVK DPUIP EBLON EBS EIOEI EJD ESX FERAY FIGPU FINBP FNLPD FSGXE GGCAI GQ6 GQ7 H13 HG6 I-F IKXTQ IWAJR J-C JBSCW JZLTJ L8X LLZTM M4Y MK~ NPVJJ NQJWS NU0 O9J PT4 ROL RSV SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE TSG TUS UOJIU UTJUX UZXMN VFIZW Z5O Z7R Z7V Z7X Z7Y Z7Z Z81 Z83 Z85 Z88 ZMTXR ~8M AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION 06D 0VY 23M 29~ 2KM 30V 408 5GY 96X AAJKR AARTL AAYIU AAYQN AAZMS ABTHY ACGFS ACKNC ADHHG ADHIR AEGNC AEJHL AENEX AEPYU AETCA AFWTZ AFZKB AGDGC AGWZB AGYKE AHYZX AIIXL AMKLP AMYQR ANMIH AYJHY ESBYG FFXSO FRRFC FYJPI GGRSB GJIRD GX1 HMJXF HRMNR HZ~ I0C IXD J9A KOV O93 OVT P9P R9I RLLFE S27 S3B SEG SHX T13 U2A UG4 VC2 W48 WK8 ~A9
ID	FETCH-LOGICAL-c363t-14f1a6647cc28b39a31ca04a65e084ffdd6dc1963bb9592e4cbdf8b4c97777d73
IEDL.DBID	RSV
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000707296800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2193-567X 1319-8025
IngestDate	Mon Jun 30 09:06:07 EDT 2025 Sat Nov 29 02:51:41 EST 2025 Tue Nov 18 22:40:02 EST 2025 Fri Feb 21 02:46:57 EST 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Machine scheduling Common due window Identical parallel machines Iterated greedy Heuristics Earliness and tardiness
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c363t-14f1a6647cc28b39a31ca04a65e084ffdd6dc1963bb9592e4cbdf8b4c97777d73
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-9314-717X 0000-0002-0239-1725 0000-0002-3920-089X
OpenAccessLink	http://dx.doi.org/10.1007/s13369-021-06244-9
PQID	2643264763
PQPubID	2044268
PageCount	15
ParticipantIDs	proquest_journals_2643264763 crossref_primary_10_1007_s13369_021_06244_9 crossref_citationtrail_10_1007_s13369_021_06244_9 springer_journals_10_1007_s13369_021_06244_9
PublicationCentury	2000
PublicationDate	2022-03-01
PublicationDateYYYYMMDD	2022-03-01
PublicationDate_xml	– month: 03 year: 2022 text: 2022-03-01 day: 01
PublicationDecade	2020
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Heidelberg
PublicationTitle	Arabian journal for science and engineering (2011)
PublicationTitleAbbrev	Arab J Sci Eng
PublicationYear	2022
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	Gerstl, Mosheiov (CR19) 2013; 113 Gerstl, Mosheiov (CR21) 2013; 229 Mor, Mosheiov (CR4) 2021; 42 Rocholl, Mönch (CR12) 2018; 52 Kramer, Lee (CR15) 1994; 20 Janiak, Janiak, Kovalyov, Werner (CR18) 2012; 10 Ying, Lin, Huang (CR31) 2009; 36 Ying, Lin, Lu (CR25) 2017; 55 Ruiz, Stützle (CR27) 2007; 177 Biskup, Feldmann (CR6) 2005; 162 Mosheiov, Oron (CR16) 2004; 51 Rolim, Nagano (CR5) 2020 Mönch, Fowler, Dauzère-Pérès, Mason, Rose (CR11) 2011; 14 Lin, Lee, Ying, Lu (CR33) 2011; 38 Lin, Lu, Ying (CR30) 2011; 53 Mosheiov, Sarig (CR20) 2010; 201 Lin, Chou, Ying (CR26) 2007; 177 Baker, Scudder (CR1) 1990; 38 Janiak, Janiak, Krysiak, Kwiatkowski (CR7) 2015; 242 Koulamas (CR8) 1996; 91 Chen, Powell (CR36) 1999; 116 Janiak, Janiak, Kovalyov, Kozan, Pesch (CR22) 2013; 224 Arroyo, Leung (CR28) 2017; 105 Alvarez-Valdes, Tamarit, Villa (CR24) 2015; 54 Graham, Lawler, Lenstra, Kan (CR23) 1979; 5 Mönch, Unbehaun, Choung (CR10) 2006; 28 Choi, Park (CR2) 2021; 41 Mosheiov, Sarig (CR17) 2011; 62 Ribas, Companys, Tort-Martorell (CR29) 2019; 121 Chen, Lee (CR14) 2002; 136 Kang, He, Wei (CR32) 2013; 73 Mula, Bogataj (CR13) 2021 Biskup, Feldmann (CR34) 2001; 28 Gordon, Proth, Chu (CR3) 2002; 13 Wu, Lai (CR9) 2007; 53 Beasley (CR35) 1990; 41 J Mula (6244_CR13) 2021 KC Ying (6244_CR31) 2009; 36 Q Kang (6244_CR32) 2013; 73 D Biskup (6244_CR34) 2001; 28 SW Lin (6244_CR33) 2011; 38 BC Choi (6244_CR2) 2021; 41 VS Gordon (6244_CR3) 2002; 13 A Janiak (6244_CR7) 2015; 242 R Ruiz (6244_CR27) 2007; 177 L Mönch (6244_CR11) 2011; 14 KC Ying (6244_CR25) 2017; 55 I Ribas (6244_CR29) 2019; 121 ZL Chen (6244_CR14) 2002; 136 JEC Arroyo (6244_CR28) 2017; 105 D Biskup (6244_CR6) 2005; 162 Y Wu (6244_CR9) 2007; 53 A Janiak (6244_CR18) 2012; 10 J Rocholl (6244_CR12) 2018; 52 L Mönch (6244_CR10) 2006; 28 E Gerstl (6244_CR19) 2013; 113 RL Graham (6244_CR23) 1979; 5 G Mosheiov (6244_CR17) 2011; 62 R Alvarez-Valdes (6244_CR24) 2015; 54 SW Lin (6244_CR26) 2007; 177 B Mor (6244_CR4) 2021; 42 SW Lin (6244_CR30) 2011; 53 ZL Chen (6244_CR36) 1999; 116 GA Rolim (6244_CR5) 2020 G Mosheiov (6244_CR16) 2004; 51 C Koulamas (6244_CR8) 1996; 91 FJ Kramer (6244_CR15) 1994; 20 E Gerstl (6244_CR21) 2013; 229 KR Baker (6244_CR1) 1990; 38 JE Beasley (6244_CR35) 1990; 41 A Janiak (6244_CR22) 2013; 224 G Mosheiov (6244_CR20) 2010; 201
References_xml	– volume: 51 start-page: 1005 issue: 7 year: 2004 end-page: 1017 ident: CR16 article-title: Due-window assignment with unit processing-time jobs publication-title: Naval Res. Logist. doi: 10.1002/nav.20039 – volume: 28 start-page: 787 issue: 8 year: 2001 end-page: 801 ident: CR34 article-title: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates publication-title: Comput. Oper. Res. doi: 10.1016/s0305-0548(00)00008-3 – volume: 38 start-page: 22 issue: 1 year: 1990 end-page: 36 ident: CR1 article-title: Sequencing with earliness and tardiness penalties: a review publication-title: Oper. Res. doi: 10.1287/opre.38.1.22 – volume: 53 start-page: 215 issue: 2 year: 2007 end-page: 221 ident: CR9 article-title: A production scheduling strategy with a common due window publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2007.06.012 – volume: 201 start-page: 712 issue: 3 year: 2010 end-page: 719 ident: CR20 article-title: Scheduling identical jobs and due-window on uniform machines publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2009.03.039 – volume: 113 start-page: 754 issue: 19–21 year: 2013 end-page: 759 ident: CR19 article-title: An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2013.06.013 – volume: 54 start-page: 1 year: 2015 end-page: 11 ident: CR24 article-title: Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.08.020 – volume: 52 start-page: 1329 issue: 4–5 year: 2018 end-page: 1350 ident: CR12 article-title: Hybrid algorithms for the earliness-tardiness single-machine multiple orders per job scheduling problem with a common due date publication-title: RAIRO-Oper. Rese. doi: 10.1051/ro/2018029 – volume: 13 start-page: 117 issue: 2 year: 2002 end-page: 132 ident: CR3 article-title: Due date assignment and scheduling: SLK, TWK and other due date assignment models publication-title: Prod. Plann. Control doi: 10.1080/09537280110069621 – volume: 229 start-page: 41 issue: 1 year: 2013 end-page: 47 ident: CR21 article-title: Due-window assignment with identical jobs on parallel uniform machines publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.12.034 – volume: 121 start-page: 347 year: 2019 end-page: 361 ident: CR29 article-title: An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem publication-title: Expert Syst. Applic. doi: 10.1016/j.eswa.2018.12.039 – volume: 28 start-page: 177 issue: 2 year: 2006 end-page: 198 ident: CR10 article-title: Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint publication-title: OR Spectrum doi: 10.1007/s00291-005-0013-4 – volume: 224 start-page: 109 year: 2013 end-page: 117 ident: CR22 article-title: Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs publication-title: Inf. Sci. doi: 10.1016/j.ins.2012.10.024 – volume: 177 start-page: 2033 issue: 3 year: 2007 end-page: 2049 ident: CR27 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.12.009 – volume: 105 start-page: 84 year: 2017 end-page: 100 ident: CR28 article-title: An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2016.12.038 – volume: 41 start-page: 781 year: 2021 end-page: 793 ident: CR2 article-title: Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty publication-title: J. Comb. Optim. doi: 10.1007/s10878-021-00714-4 – volume: 177 start-page: 1294 issue: 2 year: 2007 end-page: 1301 ident: CR26 article-title: A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.11.015 – volume: 14 start-page: 583 issue: 6 year: 2011 end-page: 599 ident: CR11 article-title: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations publication-title: J. Sched. doi: 10.1007/s10951-010-0222-9 – volume: 38 start-page: 809 issue: 5 year: 2011 end-page: 815 ident: CR33 article-title: Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates publication-title: Comput. Operat. Res. doi: 10.1016/j.cor.2010.09.020 – volume: 116 start-page: 220 issue: 1 year: 1999 end-page: 232 ident: CR36 article-title: A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/s0377-2217(98)00136-2 – volume: 42 start-page: 327 year: 2021 end-page: 38 ident: CR4 article-title: A note on the single machine CON and CONW problems with lot scheduling publication-title: J. Combinat. Optim. doi: 10.1007/s10878-021-00709-1 – volume: 55 start-page: 1707 issue: 6 year: 2017 end-page: 1719 ident: CR25 article-title: Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2016.1224949 – volume: 62 start-page: 238 issue: 1 year: 2011 end-page: 241 ident: CR17 article-title: A note: a due-window assignment problem on parallel identical machines publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.2009.179 – volume: 36 start-page: 7087 issue: 3 year: 2009 end-page: 7092 ident: CR31 article-title: Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic publication-title: Expert Syst. Applic. doi: 10.1016/j.eswa.2008.08.033 – volume: 242 start-page: 347 issue: 2 year: 2015 end-page: 357 ident: CR7 article-title: A survey on scheduling problems with due windows publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2014.09.043 – volume: 41 start-page: 1069 issue: 11 year: 1990 end-page: 1072 ident: CR35 article-title: OR-library: Distributing test problems by electronic mail publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.1990.166 – volume: 20 start-page: 69 issue: 2 year: 1994 end-page: 89 ident: CR15 article-title: Due window scheduling for parallel machines publication-title: Math. Comput. Modell. doi: 10.1016/0895-7177(94)90208-9 – year: 2020 ident: CR5 article-title: Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2020.106803 – volume: 162 start-page: 740 issue: 3 year: 2005 end-page: 761 ident: CR6 article-title: On scheduling around large restrictive common due windows publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2003.10.026 – volume: 53 start-page: 353 issue: 1–4 year: 2011 end-page: 361 ident: CR30 article-title: Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-010-2824-y – volume: 10 start-page: 347 issue: 4 year: 2012 end-page: 360 ident: CR18 article-title: Soft due window assignment and scheduling of unit-time jobs on parallel machines publication-title: 4OR Quart. J. Oper. Res. doi: 10.1007/s10288-012-0201-4 – volume: 91 start-page: 190 issue: 1 year: 1996 end-page: 202 ident: CR8 article-title: Single-machine scheduling with time windows and earliness/tardiness penalties publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(95)00116-6 – year: 2021 ident: CR13 article-title: OR in the industrial engineering of industry 4.0: experiences from the iberian peninsula mirrored in CJOR publication-title: Central Eur. J. Oper. Res. doi: 10.1007/s10100-021-00740-x – volume: 136 start-page: 512 issue: 3 year: 2002 end-page: 527 ident: CR14 article-title: Parallel machine scheduling with a common due window publication-title: Eur. J. Oper. Res. doi: 10.1016/s0377-2217(01)00068-6 – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: CR23 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discr. Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 73 start-page: 1106 issue: 8 year: 2013 end-page: 1115 ident: CR32 article-title: An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems publication-title: J. Parall. Distrib. Comput. doi: 10.1016/j.jpdc.2013.03.008 – volume: 28 start-page: 787 issue: 8 year: 2001 ident: 6244_CR34 publication-title: Comput. Oper. Res. doi: 10.1016/s0305-0548(00)00008-3 – volume: 10 start-page: 347 issue: 4 year: 2012 ident: 6244_CR18 publication-title: 4OR Quart. J. Oper. Res. doi: 10.1007/s10288-012-0201-4 – volume: 224 start-page: 109 year: 2013 ident: 6244_CR22 publication-title: Inf. Sci. doi: 10.1016/j.ins.2012.10.024 – volume: 54 start-page: 1 year: 2015 ident: 6244_CR24 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.08.020 – volume: 14 start-page: 583 issue: 6 year: 2011 ident: 6244_CR11 publication-title: J. Sched. doi: 10.1007/s10951-010-0222-9 – volume: 162 start-page: 740 issue: 3 year: 2005 ident: 6244_CR6 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2003.10.026 – volume: 136 start-page: 512 issue: 3 year: 2002 ident: 6244_CR14 publication-title: Eur. J. Oper. Res. doi: 10.1016/s0377-2217(01)00068-6 – volume: 229 start-page: 41 issue: 1 year: 2013 ident: 6244_CR21 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.12.034 – volume: 53 start-page: 353 issue: 1–4 year: 2011 ident: 6244_CR30 publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-010-2824-y – volume: 41 start-page: 1069 issue: 11 year: 1990 ident: 6244_CR35 publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.1990.166 – volume: 73 start-page: 1106 issue: 8 year: 2013 ident: 6244_CR32 publication-title: J. Parall. Distrib. Comput. doi: 10.1016/j.jpdc.2013.03.008 – year: 2021 ident: 6244_CR13 publication-title: Central Eur. J. Oper. Res. doi: 10.1007/s10100-021-00740-x – volume: 53 start-page: 215 issue: 2 year: 2007 ident: 6244_CR9 publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2007.06.012 – volume: 177 start-page: 1294 issue: 2 year: 2007 ident: 6244_CR26 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.11.015 – volume: 51 start-page: 1005 issue: 7 year: 2004 ident: 6244_CR16 publication-title: Naval Res. Logist. doi: 10.1002/nav.20039 – volume: 105 start-page: 84 year: 2017 ident: 6244_CR28 publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2016.12.038 – volume: 113 start-page: 754 issue: 19–21 year: 2013 ident: 6244_CR19 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2013.06.013 – volume: 91 start-page: 190 issue: 1 year: 1996 ident: 6244_CR8 publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(95)00116-6 – volume: 41 start-page: 781 year: 2021 ident: 6244_CR2 publication-title: J. Comb. Optim. doi: 10.1007/s10878-021-00714-4 – volume: 55 start-page: 1707 issue: 6 year: 2017 ident: 6244_CR25 publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2016.1224949 – volume: 242 start-page: 347 issue: 2 year: 2015 ident: 6244_CR7 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2014.09.043 – volume: 121 start-page: 347 year: 2019 ident: 6244_CR29 publication-title: Expert Syst. Applic. doi: 10.1016/j.eswa.2018.12.039 – volume: 38 start-page: 809 issue: 5 year: 2011 ident: 6244_CR33 publication-title: Comput. Operat. Res. doi: 10.1016/j.cor.2010.09.020 – volume: 62 start-page: 238 issue: 1 year: 2011 ident: 6244_CR17 publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.2009.179 – volume: 13 start-page: 117 issue: 2 year: 2002 ident: 6244_CR3 publication-title: Prod. Plann. Control doi: 10.1080/09537280110069621 – volume: 116 start-page: 220 issue: 1 year: 1999 ident: 6244_CR36 publication-title: Eur. J. Oper. Res. doi: 10.1016/s0377-2217(98)00136-2 – volume: 177 start-page: 2033 issue: 3 year: 2007 ident: 6244_CR27 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.12.009 – volume: 38 start-page: 22 issue: 1 year: 1990 ident: 6244_CR1 publication-title: Oper. Res. doi: 10.1287/opre.38.1.22 – volume: 201 start-page: 712 issue: 3 year: 2010 ident: 6244_CR20 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2009.03.039 – volume: 28 start-page: 177 issue: 2 year: 2006 ident: 6244_CR10 publication-title: OR Spectrum doi: 10.1007/s00291-005-0013-4 – volume: 5 start-page: 287 year: 1979 ident: 6244_CR23 publication-title: Ann. Discr. Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 36 start-page: 7087 issue: 3 year: 2009 ident: 6244_CR31 publication-title: Expert Syst. Applic. doi: 10.1016/j.eswa.2008.08.033 – volume: 52 start-page: 1329 issue: 4–5 year: 2018 ident: 6244_CR12 publication-title: RAIRO-Oper. Rese. doi: 10.1051/ro/2018029 – volume: 42 start-page: 327 year: 2021 ident: 6244_CR4 publication-title: J. Combinat. Optim. doi: 10.1007/s10878-021-00709-1 – year: 2020 ident: 6244_CR5 publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2020.106803 – volume: 20 start-page: 69 issue: 2 year: 1994 ident: 6244_CR15 publication-title: Math. Comput. Modell. doi: 10.1016/0895-7177(94)90208-9
SSID	ssib048395113 ssj0001916267 ssj0061873
Score	2.2533383
Snippet	In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows. The performance measure...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	3899
SubjectTerms	Algorithms Engineering Greedy algorithms Heuristic Humanities and Social Sciences multidisciplinary Research Article-Systems Engineering Scheduling Science Windows (computer programs)
Title	Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows
URI	https://link.springer.com/article/10.1007/s13369-021-06244-9 https://www.proquest.com/docview/2643264763
Volume	47
WOSCitedRecordID	wos000707296800001&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: PRVAVX databaseName: Springer Online Journals customDbUrl: eissn: 2191-4281 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001916267 issn: 2193-567X databaseCode: RSV dateStart: 20110101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fb9MwELbGxgN72MYvrVuZ_LA3sNTErh0_VhtTkaCqWih9ixzbGZWyZGoSEH8B__bOTkIGAiQWKU-5OJHvfHey774PofOUW5soNSYyjVLCZGBJwrQk0ggdJUJy4ZnnVu_FbBat13LeNoWVXbV7dyTpPXXf7EYpl8SVFIw4BCUiH6E9CHeRI2xYLFedFTEI-ZBF0H6nBTKg0FPJwuqkZMzFuu2e-fOwv0aoPu387aTUB6Crw4f9-hE6aBNOPGks5CnasfkztH8PhvA5-tFAGIPfw1Nbt9DNWOUGbvzOwy5bg12FjvmOJ9l1sd1UX25wVeAlqNzUmcVNvy_oG8_V1tGzZPiDL9O0JQbf5DZ7nLxrRylyvLCOLaT54mVt8edNbopv5Qv06ertx4spaQkaiKacViRgaaA4Z0LrMEqoVDTQasQUH9tRxNLUsVVpt8STRI5laJlOTBo5WxBwGUFfot28yO0xwoyrQAfaCAfHr0IlqZIiNZAdaS10Ygco6JQS6xa93JFoZHGPu-wmOYZJjv0kx3KAXv9857bB7vin9LDTddyu4zKGdBHyWwZOeIDedLrtH_99tJP_Ez9FT0LXV-GL24Zot9rW9hV6rL9Wm3J75u37Dqxu9Ao
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB6VFolyoLwqtg_wgRtY2sReOz5WLdVW3a6qtpS9RY7twEpLgjZZEL-gf7tjJyGAChJEyikTJ_KMZz7ZM98AvM6Fc5nWI6ryJKdcRY5m3CiqrDRJJpWQofPc9UROp8lsps7borCqy3bvjiSDp-6L3RgTivqUgqHAoETVPdjgGLE8Y_7F5XVnRRxDPqII1u-0IAKKQytZXJ2MjoSctdUzdw_7a4TqYedvJ6UhAB1v_d-vP4ZHLeAkB42FPIE1VzyFhz_RED6Dm4bCGP0eGbtVS91MdGHxJieBdtlZ4jN07HdysPhYLuf1p8-kLsklqtyuFo409b6ob3Kul749y4KchTRNVxH0TX6zx8v7cpSyIBfOdwtpvni0cuTDvLDlt-o5vD9-d3U4pm2DBmqYYDWNeB5pIbg0Jk4ypjSLjB5yLUZumPA8992qjF_iWaZGKnbcZDZPvC1IvKxk27BelIV7AYQLHZnIWOnp-HWsFdNK5hbRkTHSZG4AUaeU1LTs5b6JxiLteZf9JKc4yWmY5FQN4M2Pd7403B1_ld7rdJ2267hKES4ivuXohAfwttNt__jPo-38m_greDC-Opukk5Pp6S5sxr7GIiS67cF6vVy5fbhvvtbzavky2PotJFf27g
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Nb9QwEB2VFiE4UD7FQgs-cAOrm9hrx8eKsmrVslpRKHuLHH_ASktS7WZB_QX923ichBREkRCRcorjKPbY82zPvAfw0gvnCq1HVPnMU64SRwtuFFVWmqyQSsioPHd2IieTbDZT0ytZ_DHavTuSbHIakKWprPfOrd_rE98YE4pieMFQBAdF1Q3Y4hhIj-v107POonhw_wFRsH7XJaChNMrKhpHK6EjIWZtJ8-dqf_VWPQT97dQ0OqPx9v__xj242wJRst9Yzn3YcOUDuHOFnvAhXDbUxmE-JIdu3VI6E13acJOjSMfsLMHIHXtB9hefq-W8_vKV1BU5DaZg1wtHmjzgYAdkqpco27Ig72L4pluRMGfhJhCWxzSVqiTvHaqINF88WDvyaV7a6vvqEXwcv_3w5pC2wg3UMMFqmnCfaCG4NCbNCqY0S4weci1Gbphx71HFyuDQLwo1UqnjprA-QxuR4bKSPYbNsirdEyBc6MQkxkqk6depVkwr6W1ATcZIU7gBJF0H5aZlNUdxjUXe8zFjI-ehkfPYyLkawKuf75w3nB5_Lb3T9Xveju9VHmBkwL08TM4DeN31c__4-tqe_lvxF3BrejDOT44mx8_gdoqpFzH-bQc26-Xa7cJN862er5bPo9n_AN-r_9I
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=Effective+Heuristics+and+an+Iterated+Greedy+Algorithm+to+Schedule+Identical+Parallel+Machines+Subject+to+Common+Restrictive+Due+Windows&rft.jtitle=Arabian+journal+for+science+and+engineering+%282011%29&rft.au=Rolim%2C+Gustavo+Alencar&rft.au=Nagano%2C+Marcelo+Seido&rft.au=Prata%2C+Bruno+de+Athayde&rft.date=2022-03-01&rft.issn=2193-567X&rft.eissn=2191-4281&rft.volume=47&rft.issue=3&rft.spage=3899&rft.epage=3913&rft_id=info:doi/10.1007%2Fs13369-021-06244-9&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s13369_021_06244_9
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2193-567X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2193-567X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2193-567X&client=summon