Scheduling two parallel machines with machine-dependent availabilities

A two-parallel-machine scheduling problem with machine-dependent availabilities where one machine is subject to tool changes and the other is subject to periodic maintenance is considered. The objective is to determine the start time of each tool change activity and schedule all the jobs to the two...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 72; pp. 31 - 42
Main Authors:	He, Jie, Li, Qingguo, Xu, Dehua
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.08.2016 Pergamon Press Inc
Subjects:	Algorithms Availability Computer simulation Heuristic Heuristic methods High strength steels Integer programming Job shops Maintenance Makespan Operations research Optimization algorithms Parallel processing Periodic maintenance Polynomials Production scheduling Scheduling Studies Tool change Scheduling Makespan Tool change Periodic maintenance Heuristic
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	A two-parallel-machine scheduling problem with machine-dependent availabilities where one machine is subject to tool changes and the other is subject to periodic maintenance is considered. The objective is to determine the start time of each tool change activity and schedule all the jobs to the two machines such that the makespan is minimized. Due to the NP-hardness of the non-approximability of the problem, there does not exist any polynomial time approximation algorithm with a worst-case ratio less than 2 for the problem unless P=NP. To solve small sized and moderate sized instances of the problem, a mixed 0–1 programming model is proposed. To solve large sized instances of the problem, nine heuristic algorithms that employ two classical dispatching rules, two assignment mechanisms and a post-optimization procedure are proposed. To evaluate the performance of the algorithms, some machine setting featured lower bounds are provided. Computational experiment shows that the average-case relative error ratio of the heuristic algorithm that based on the classical LPT rule, two assignment procedures and a post-optimization procedure is less than 8%, which implies that it is promising for problem and suitable for real-world application. •A scheduling problem with machine-dependent availabilities is considered.•Nine heuristic algorithms are proposed.•Worst-case analyses are presented.•Machine setting featured lower bounds are provided.•Computational experiment is conducted.
AbstractList	A two-parallel-machine scheduling problem with machine-dependent availabilities where one machine is subject to tool changes and the other is subject to periodic maintenance is considered. The objective is to determine the start time of each tool change activity and schedule all the jobs to the two machines such that the makespan is minimized. Due to the NP-hardness of the non-approximability of the problem, there does not exist any polynomial time approximation algorithm with a worst-case ratio less than 2 for the problem unless P=NP. To solve small sized and moderate sized instances of the problem, a mixed 0–1 programming model is proposed. To solve large sized instances of the problem, nine heuristic algorithms that employ two classical dispatching rules, two assignment mechanisms and a post-optimization procedure are proposed. To evaluate the performance of the algorithms, some machine setting featured lower bounds are provided. Computational experiment shows that the average-case relative error ratio of the heuristic algorithm that based on the classical LPT rule, two assignment procedures and a post-optimization procedure is less than 8%, which implies that it is promising for problem and suitable for real-world application. •A scheduling problem with machine-dependent availabilities is considered.•Nine heuristic algorithms are proposed.•Worst-case analyses are presented.•Machine setting featured lower bounds are provided.•Computational experiment is conducted. A two-parallel-machine scheduling problem with machine-dependent availabilities where one machine is subject to tool changes and the other is subject to periodic maintenance is considered. The objective is to determine the start time of each tool change activity and schedule all the jobs to the two machines such that the makespan is minimized. Due to the NP-hardness of the non-approximability of the problem, there does not exist any polynomial time approximation algorithm with a worst-case ratio less than 2 for the problem unless P=NP. To solve small sized and moderate sized instances of the problem, a mixed 0-1 programming model is proposed. To solve large sized instances of the problem, nine heuristic algorithms that employ two classical dispatching rules, two assignment mechanisms and a post-optimization procedure are proposed. To evaluate the performance of the algorithms, some machine setting featured lower bounds are provided. Computational experiment shows that the average-case relative error ratio of the heuristic algorithm that based on the classical LPT rule, two assignment procedures and a post-optimization procedure is less than 8%, which implies that it is promising for problem and suitable for real-world application.
Author	He, Jie Xu, Dehua Li, Qingguo
Author_xml	– sequence: 1 givenname: Jie surname: He fullname: He, Jie email: jhe@ecit.cn organization: College of Mathematics and Econometrics, Hunan University, Changsha, Hunan 410082, PR China – sequence: 2 givenname: Qingguo surname: Li fullname: Li, Qingguo email: liqingguoli@aliyun.com organization: College of Mathematics and Econometrics, Hunan University, Changsha, Hunan 410082, PR China – sequence: 3 givenname: Dehua surname: Xu fullname: Xu, Dehua email: dhxu@ecit.cn organization: School of Science, East China University of Technology, Nanchang, Jiangxi 330013, PR China
BookMark	eNqNkc9LHDEUx0Ox0NX2D-htwIuXGfMykx-DpyLaCoIHLfQWMpk33SzZZJtkFf_7Rra9eBDfJS_h83mQ9z0mRyEGJOQr0A4oiPNNZ2PqWG07Ch1l8IGsQMm-lYL_OiIr2lPeUj6oT-Q45w2tJRmsyPW9XeO89y78bspTbHYmGe_RN1tj1y5gbp5cWf-_tTPuMMwYSmMejfNmct4Vh_kz-bgYn_HLv_OE_Ly-erj80d7efb-5_Hbb2qEfS4sKJ8lsjzhOMLDeSKkWnGYQ_cJQGEuVxaVXfAK2AKpxELjMZqRDfeaC9yfk7DB3l-KfPeaity5b9N4EjPusQTE-DJLx96AgqOBsHCt6-grdxH0K9SMapBpGIUcKlZIHyqaYc8JFW1dMcTGUVHehgeqXKPRG1yj0SxSagq5RVBNembvktiY9v-lcHBys63x0mHS2DoPF2SW0Rc_RvWH_BeZuo58
CODEN	CMORAP
CitedBy_id	crossref_primary_10_1108_JM2_09_2023_0198 crossref_primary_10_1080_00207543_2019_1661539 crossref_primary_10_1080_00207543_2018_1459923 crossref_primary_10_1016_j_ijpe_2017_01_014 crossref_primary_10_1007_s11424_024_3284_z crossref_primary_10_1016_j_asoc_2022_109154 crossref_primary_10_1080_00207543_2021_1951447 crossref_primary_10_1109_ACCESS_2019_2937747 crossref_primary_10_1080_00207543_2018_1471242 crossref_primary_10_1080_21681015_2021_1883131 crossref_primary_10_1080_24725854_2022_2100523 crossref_primary_10_1016_j_cie_2018_07_006 crossref_primary_10_1080_21681015_2022_2052195 crossref_primary_10_1007_s10589_019_00142_5 crossref_primary_10_1080_00207543_2024_2334419
Cites_doi	10.1057/palgrave.jors.2602043 10.1016/S0377-2217(03)00232-7 10.1007/s00170-006-0689-x 10.1016/j.apm.2013.03.001 10.1016/j.ejor.2007.06.029 10.1016/j.cor.2008.05.001 10.1016/j.cie.2008.03.005 10.1016/j.omega.2012.04.003 10.1016/j.dam.2006.06.005 10.1016/j.ins.2014.02.142 10.1016/j.cor.2005.08.014 10.1016/j.cor.2005.05.034 10.1007/s10951-010-0182-0 10.1016/j.cor.2006.08.015 10.1016/S0305-0548(02)00074-6 10.1057/palgrave.jors.2601998 10.1007/s00170-005-0253-0 10.1007/s00170-011-3249-y 10.1016/S0167-5060(08)70356-X 10.1080/00207543.2013.855833 10.1057/palgrave.jors.2600791 10.1016/j.omega.2014.11.002 10.1016/j.omega.2008.01.001 10.1002/nav.10045 10.1016/j.ijpe.2009.10.018
ContentType	Journal Article
Copyright	2016 Elsevier Ltd Copyright Pergamon Press Inc. Aug 2016
Copyright_xml	– notice: 2016 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Aug 2016
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.cor.2016.01.021
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology 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 Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts Computer and Information Systems Abstracts Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business
EISSN	1873-765X 0305-0548
EndPage	42
ExternalDocumentID	4038176271 10_1016_j_cor_2016_01_021 S0305054816300181
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c439t-e8eb72c3ee9b1423a778febd163f2e6ac08cef385b12f1e8946efda904cef5653
ISICitedReferencesCount	20
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000375502800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0305-0548
IngestDate	Thu Oct 02 12:13:36 EDT 2025 Sat Sep 27 20:45:00 EDT 2025 Sun Nov 09 07:12:38 EST 2025 Tue Nov 18 21:43:31 EST 2025 Sat Nov 29 03:23:39 EST 2025 Fri Feb 23 02:33:27 EST 2024
IsPeerReviewed	true
IsScholarly	true
Keywords	Scheduling Makespan Tool change Periodic maintenance Heuristic
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c439t-e8eb72c3ee9b1423a778febd163f2e6ac08cef385b12f1e8946efda904cef5653
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
PQID	1784967901
PQPubID	23500
PageCount	12
ParticipantIDs	proquest_miscellaneous_1825447255 proquest_miscellaneous_1816065299 proquest_journals_1784967901 crossref_citationtrail_10_1016_j_cor_2016_01_021 crossref_primary_10_1016_j_cor_2016_01_021 elsevier_sciencedirect_doi_10_1016_j_cor_2016_01_021
PublicationCentury	2000
PublicationDate	2016-08-01
PublicationDateYYYYMMDD	2016-08-01
PublicationDate_xml	– month: 08 year: 2016 text: 2016-08-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Computers & operations research
PublicationYear	2016
Publisher	Elsevier Ltd Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Pergamon Press Inc
References	Xu, Yin, Li (bib11) 2010; 13 Akturk, Ghosh, Kayan (bib20) 2007; 34 Chen (bib9) 2009; 37 Xu, Xu (bib15) 2015; 15 Yin, Ye, Zhang (bib16) 2014; 274 Qi, Chen, Tu (bib22) 1999; 50 Sun, Li (bib24) 2010; 124 Xu, Yin (bib27) 2011; 56 Qi (bib23) 2007; 155 Ji, He, Cheng (bib26) 2007; 34 Chen (bib3) 2006; 57 Xu, Sun, Li (bib6) 2008; 35 Xu, Cheng, Yin, Li (bib10) 2009; 36 Xu, Liu, Yin, Hao (bib12) 2013; 41 Liao, Chen (bib1) 2003; 30 Chen (bib2) 2006; 57 Akturk, Ghosh, Gunes (bib18) 2003; 50 Sbihi, Varnier (bib7) 2008; 55 Xu, Yang (bib13) 2013; 37 Chen (bib8) 2008; 190 Pinedo (bib25) 2008 Yin, Wu, Cheng, Wu (bib17) 2014; 52 Chen (bib4) 2007; 31 Chen (bib5) 2007; 34 Graham, Lawler, Lenstra, Rinnooy (bib21) 1979; 5 Akturk, Ghosh, Gunes (bib19) 2004; 157 Xu, Wan, Liu, Yang (bib14) 2015; 52 Pinedo (10.1016/j.cor.2016.01.021_bib25) 2008 Chen (10.1016/j.cor.2016.01.021_bib3) 2006; 57 Chen (10.1016/j.cor.2016.01.021_bib9) 2009; 37 Yin (10.1016/j.cor.2016.01.021_bib17) 2014; 52 Graham (10.1016/j.cor.2016.01.021_bib21) 1979; 5 Xu (10.1016/j.cor.2016.01.021_bib11) 2010; 13 Sbihi (10.1016/j.cor.2016.01.021_bib7) 2008; 55 Yin (10.1016/j.cor.2016.01.021_bib16) 2014; 274 Ji (10.1016/j.cor.2016.01.021_bib26) 2007; 34 Akturk (10.1016/j.cor.2016.01.021_bib18) 2003; 50 Qi (10.1016/j.cor.2016.01.021_bib22) 1999; 50 Akturk (10.1016/j.cor.2016.01.021_bib20) 2007; 34 Xu (10.1016/j.cor.2016.01.021_bib27) 2011; 56 Liao (10.1016/j.cor.2016.01.021_bib1) 2003; 30 Xu (10.1016/j.cor.2016.01.021_bib12) 2013; 41 Xu (10.1016/j.cor.2016.01.021_bib13) 2013; 37 Xu (10.1016/j.cor.2016.01.021_bib10) 2009; 36 Chen (10.1016/j.cor.2016.01.021_bib2) 2006; 57 Chen (10.1016/j.cor.2016.01.021_bib5) 2007; 34 Xu (10.1016/j.cor.2016.01.021_bib14) 2015; 52 Qi (10.1016/j.cor.2016.01.021_bib23) 2007; 155 Chen (10.1016/j.cor.2016.01.021_bib4) 2007; 31 Chen (10.1016/j.cor.2016.01.021_bib8) 2008; 190 Akturk (10.1016/j.cor.2016.01.021_bib19) 2004; 157 Xu (10.1016/j.cor.2016.01.021_bib6) 2008; 35 Xu (10.1016/j.cor.2016.01.021_bib15) 2015; 15 Sun (10.1016/j.cor.2016.01.021_bib24) 2010; 124
References_xml	– volume: 274 start-page: 310 year: 2014 end-page: 322 ident: bib16 article-title: Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval publication-title: Inf Sci – volume: 37 start-page: 7561 year: 2013 end-page: 7567 ident: bib13 article-title: Makespan minimization for two parallel machines scheduling with a periodic availability constraint publication-title: Appl Math Model – volume: 52 start-page: 101 year: 2015 end-page: 106 ident: bib14 article-title: Single machine total completion time scheduling problem with workload-dependent maintenance duration publication-title: Omega – volume: 155 start-page: 416 year: 2007 end-page: 422 ident: bib23 article-title: A note on worst-case performance of heuristics for maintenance scheduling problems publication-title: Discret Appl Math – volume: 30 start-page: 1335 year: 2003 end-page: 1347 ident: bib1 article-title: Single-machine scheduling with periodic maintenance and nonresumable jobs publication-title: Comput Oper Res – volume: 37 start-page: 591 year: 2009 end-page: 599 ident: bib9 article-title: Minimizing number of tardy jobs on a single machine subject to periodic maintenance publication-title: Omega – volume: 15 start-page: 423 year: 2015 end-page: 436 ident: bib15 article-title: Single-machine scheduling with preemptive jobs and workload-dependent maintenance durations publication-title: Oper Res – volume: 35 start-page: 1344 year: 2008 end-page: 1349 ident: bib6 article-title: Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan publication-title: Comput Oper Res – volume: 34 start-page: 1173 year: 2007 end-page: 1182 ident: bib5 article-title: An efficient algorithm for scheduling jobs on a machine with periodic maintenance publication-title: Int J Adv Manuf Technol – volume: 52 start-page: 2311 year: 2014 end-page: 2326 ident: bib17 article-title: Due date assignment and single-machine scheduling with generalized positional deteriorating jobs and deteriorating multi-maintenance activities publication-title: Int J Prod Res – volume: 31 start-page: 737 year: 2007 end-page: 742 ident: bib4 article-title: Scheduling of jobs and maintenance in a textile company publication-title: Int J Adv Manuf Technol – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: bib21 article-title: Optimization and approximation in deterministic sequencing and scheduling publication-title: Ann Discret Math – volume: 56 start-page: 1139 year: 2011 end-page: 1145 ident: bib27 article-title: On single-machine scheduling with flexible maintenance activities publication-title: Int J Adv Manuf Technol – volume: 36 start-page: 1809 year: 2009 end-page: 1812 ident: bib10 article-title: Makespan minimization for two parallel machines scheduling with a periodic availability constraint publication-title: Comput Oper Res – volume: 57 start-page: 703 year: 2006 end-page: 710 ident: bib2 article-title: Single-machine scheduling with flexible and periodic maintenance publication-title: J Oper Res Soc – volume: 190 start-page: 90 year: 2008 end-page: 102 ident: bib8 article-title: Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan publication-title: Eur J Oper Res – volume: 57 start-page: 410 year: 2006 end-page: 415 ident: bib3 article-title: Minimizing total flow time in the single-machine scheduling problem with periodic maintenance publication-title: J Oper Res Soc – volume: 157 start-page: 784 year: 2004 end-page: 790 ident: bib19 article-title: Scheduling with tool changes to minimize total completion time publication-title: Eur J Oper Res – volume: 50 start-page: 1071 year: 1999 end-page: 1078 ident: bib22 article-title: Scheduling the maintenance on a single machine publication-title: J Oper Res Soc – volume: 13 start-page: 443 year: 2010 end-page: 449 ident: bib11 article-title: Scheduling jobs under increasing linear machine maintenance time publication-title: J Sched – volume: 50 start-page: 15 year: 2003 end-page: 30 ident: bib18 article-title: Scheduling with tool changes to minimize total completion time publication-title: Nav Res Logist – volume: 34 start-page: 2130 year: 2007 end-page: 2146 ident: bib20 article-title: Scheduling with tool changes to minimize total completion time under controllable machining conditions publication-title: Comput Oper Res – volume: 41 start-page: 299 year: 2013 end-page: 304 ident: bib12 article-title: Scheduling tool changes and special jobs on a single machine to minimize makespan publication-title: Omega – volume: 34 start-page: 1764 year: 2007 end-page: 1770 ident: bib26 article-title: Single-machine scheduling with periodic maintenance to minimize makespan publication-title: Comput Oper Res – year: 2008 ident: bib25 article-title: Scheduling: theory, algorithms, and systems – volume: 124 start-page: 151 year: 2010 end-page: 158 ident: bib24 article-title: Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines publication-title: Int J Prod Econ – volume: 55 start-page: 830 year: 2008 end-page: 840 ident: bib7 article-title: Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness publication-title: Comput Ind Eng – volume: 57 start-page: 703 year: 2006 ident: 10.1016/j.cor.2016.01.021_bib2 article-title: Single-machine scheduling with flexible and periodic maintenance publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2602043 – volume: 157 start-page: 784 year: 2004 ident: 10.1016/j.cor.2016.01.021_bib19 article-title: Scheduling with tool changes to minimize total completion time publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(03)00232-7 – year: 2008 ident: 10.1016/j.cor.2016.01.021_bib25 – volume: 34 start-page: 1173 year: 2007 ident: 10.1016/j.cor.2016.01.021_bib5 article-title: An efficient algorithm for scheduling jobs on a machine with periodic maintenance publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-006-0689-x – volume: 37 start-page: 7561 year: 2013 ident: 10.1016/j.cor.2016.01.021_bib13 article-title: Makespan minimization for two parallel machines scheduling with a periodic availability constraint publication-title: Appl Math Model doi: 10.1016/j.apm.2013.03.001 – volume: 190 start-page: 90 year: 2008 ident: 10.1016/j.cor.2016.01.021_bib8 article-title: Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2007.06.029 – volume: 36 start-page: 1809 year: 2009 ident: 10.1016/j.cor.2016.01.021_bib10 article-title: Makespan minimization for two parallel machines scheduling with a periodic availability constraint publication-title: Comput Oper Res doi: 10.1016/j.cor.2008.05.001 – volume: 55 start-page: 830 year: 2008 ident: 10.1016/j.cor.2016.01.021_bib7 article-title: Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness publication-title: Comput Ind Eng doi: 10.1016/j.cie.2008.03.005 – volume: 41 start-page: 299 year: 2013 ident: 10.1016/j.cor.2016.01.021_bib12 article-title: Scheduling tool changes and special jobs on a single machine to minimize makespan publication-title: Omega doi: 10.1016/j.omega.2012.04.003 – volume: 155 start-page: 416 year: 2007 ident: 10.1016/j.cor.2016.01.021_bib23 article-title: A note on worst-case performance of heuristics for maintenance scheduling problems publication-title: Discret Appl Math doi: 10.1016/j.dam.2006.06.005 – volume: 274 start-page: 310 year: 2014 ident: 10.1016/j.cor.2016.01.021_bib16 article-title: Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval publication-title: Inf Sci doi: 10.1016/j.ins.2014.02.142 – volume: 34 start-page: 2130 year: 2007 ident: 10.1016/j.cor.2016.01.021_bib20 article-title: Scheduling with tool changes to minimize total completion time under controllable machining conditions publication-title: Comput Oper Res doi: 10.1016/j.cor.2005.08.014 – volume: 34 start-page: 1764 year: 2007 ident: 10.1016/j.cor.2016.01.021_bib26 article-title: Single-machine scheduling with periodic maintenance to minimize makespan publication-title: Comput Oper Res doi: 10.1016/j.cor.2005.05.034 – volume: 13 start-page: 443 year: 2010 ident: 10.1016/j.cor.2016.01.021_bib11 article-title: Scheduling jobs under increasing linear machine maintenance time publication-title: J Sched doi: 10.1007/s10951-010-0182-0 – volume: 35 start-page: 1344 year: 2008 ident: 10.1016/j.cor.2016.01.021_bib6 article-title: Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan publication-title: Comput Oper Res doi: 10.1016/j.cor.2006.08.015 – volume: 30 start-page: 1335 year: 2003 ident: 10.1016/j.cor.2016.01.021_bib1 article-title: Single-machine scheduling with periodic maintenance and nonresumable jobs publication-title: Comput Oper Res doi: 10.1016/S0305-0548(02)00074-6 – volume: 57 start-page: 410 year: 2006 ident: 10.1016/j.cor.2016.01.021_bib3 article-title: Minimizing total flow time in the single-machine scheduling problem with periodic maintenance publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601998 – volume: 31 start-page: 737 year: 2007 ident: 10.1016/j.cor.2016.01.021_bib4 article-title: Scheduling of jobs and maintenance in a textile company publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-005-0253-0 – volume: 15 start-page: 423 year: 2015 ident: 10.1016/j.cor.2016.01.021_bib15 article-title: Single-machine scheduling with preemptive jobs and workload-dependent maintenance durations publication-title: Oper Res – volume: 56 start-page: 1139 year: 2011 ident: 10.1016/j.cor.2016.01.021_bib27 article-title: On single-machine scheduling with flexible maintenance activities publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-011-3249-y – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.cor.2016.01.021_bib21 article-title: Optimization and approximation in deterministic sequencing and scheduling publication-title: Ann Discret Math doi: 10.1016/S0167-5060(08)70356-X – volume: 52 start-page: 2311 year: 2014 ident: 10.1016/j.cor.2016.01.021_bib17 article-title: Due date assignment and single-machine scheduling with generalized positional deteriorating jobs and deteriorating multi-maintenance activities publication-title: Int J Prod Res doi: 10.1080/00207543.2013.855833 – volume: 50 start-page: 1071 year: 1999 ident: 10.1016/j.cor.2016.01.021_bib22 article-title: Scheduling the maintenance on a single machine publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2600791 – volume: 52 start-page: 101 year: 2015 ident: 10.1016/j.cor.2016.01.021_bib14 article-title: Single machine total completion time scheduling problem with workload-dependent maintenance duration publication-title: Omega doi: 10.1016/j.omega.2014.11.002 – volume: 37 start-page: 591 year: 2009 ident: 10.1016/j.cor.2016.01.021_bib9 article-title: Minimizing number of tardy jobs on a single machine subject to periodic maintenance publication-title: Omega doi: 10.1016/j.omega.2008.01.001 – volume: 50 start-page: 15 year: 2003 ident: 10.1016/j.cor.2016.01.021_bib18 article-title: Scheduling with tool changes to minimize total completion time publication-title: Nav Res Logist doi: 10.1002/nav.10045 – volume: 124 start-page: 151 year: 2010 ident: 10.1016/j.cor.2016.01.021_bib24 article-title: Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2009.10.018
SSID	ssj0000721
Score	2.282109
Snippet	A two-parallel-machine scheduling problem with machine-dependent availabilities where one machine is subject to tool changes and the other is subject to...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	31
SubjectTerms	Algorithms Availability Computer simulation Heuristic Heuristic methods High strength steels Integer programming Job shops Maintenance Makespan Operations research Optimization algorithms Parallel processing Periodic maintenance Polynomials Production scheduling Scheduling Studies Tool change
Title	Scheduling two parallel machines with machine-dependent availabilities
URI	https://dx.doi.org/10.1016/j.cor.2016.01.021 https://www.proquest.com/docview/1784967901 https://www.proquest.com/docview/1816065299 https://www.proquest.com/docview/1825447255
Volume	72
WOSCitedRecordID	wos000375502800003&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: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELegQ2g88FFAFAYKEnuhitR82n6coNVAVQHRSXmzEuc8OpW0a5uxP59zbKdjE9V44CVKXCeN7nc5n-273xHyLpeQUPQcfFWGyo8VVz6XEPoRFHyQK8XSqGyKTdDJhGUZ_2qrdK6bcgK0qtjlJV_-V6ixDcHWqbP_AHf7UGzAcwQdjwg7Hm8F_HeEoaybLPPNr0Vfc3vP5zDv_2zCJsGms9kr3xXB3fTzi3w2N6zdLrDQMRjYyg_rRk8WS1jZ-DnLFNSuKB-DibydtdoyNrG43_BtTuuFa83qwti6H3V-ddkhSNugtzbdSkf9JYYm05lSU4XH2kJr3c2oaii0bthrs3RwhuLW3KxBaihUg-3g5DbkJ1_E6GQ8FtNhNj2MRstzXxcO0xvsh9FHA-JdshfShLMO2Tv6NMw-bwdk2qTftW_sNrebML9r__w39-TaQN14H9PH5KGdNnhHBu4n5A5UXXLfZS10ySOHkWeNdZc8uEI1-ZSMtmrhoVp4Ti08pxaeVgvvhlp4f6rFM3IyGk4_HPu2hoYv0dXc-MCgoKGMALhe7otySpmCokQ3XIWQ5nLAJKiIJUUQqgAYj1NQZc4HMTajsx89J51qUcEL4nGWyKAoJARKxlSyAgWqwhgSRtFt56xHBk50QlqCeV3nZC5cJOGZQGkLLW0xCARKu0fet7csDbvKrs6xw0NY99C4fQK1addtBw47YT_TtQgoi3lK0Rnukbftz2hZ9XZZXsGixj4swNl9gv7arj6a4o_ivPzlLfq8IvvbT-mAdDarGl6Te_JiM1uv3li1_Q22wahL
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=Scheduling+two+parallel+machines+with+machine-dependent+availabilities&rft.jtitle=Computers+%26+operations+research&rft.au=Hea%2C+Jie&rft.au=Lia%2C+Qingguo&rft.au=Xub%2C+Dehua&rft.date=2016-08-01&rft.issn=0305-0548&rft.volume=72&rft.spage=31&rft.epage=42&rft_id=info:doi/10.1016%2Fj.cor.2016.01.021&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon