A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs

Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm bas...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production economics Jg. 101; H. 1; S. 19 - 29
Hauptverfasser: Ohta, Hiroshi, Nakatani, Toshihiro
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.05.2006
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:International Journal of Production Economics
Schlagworte:
Benchmarks
Due-date constraints
Heuristic
Heuristics
Holding cost
Job shops
Job-shop scheduling
Management science
Production costs
Scheduling
Scheduling algorithms
Shifting bottleneck procedure
Due-date constraints
Shifting bottleneck procedure
Heuristics
Holding cost
Job-shop scheduling
ISSN:0925-5273, 1873-7579
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm based on the shifting bottleneck procedure is proposed for solving the minimum total holding cost problem subject to no tardy jobs. Several benchmark problems which are commonly used for job-shop scheduling problems of minimizing the makespan are solved by the proposed method and the results are reported.
AbstractList Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm based on the shifting bottleneck procedure is proposed for solving the minimum total holding cost problem subject to no tardy jobs. Several benchmark problems which are commonly used for job-shop scheduling problems of minimizing the makespan are solved by the proposed method and the results are reported.
Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm based on the shifting bottleneck procedure is proposed for solving the minimum total holding cost problem subject to no tardy jobs. Several benchmark problems which are commonly used for job-shop scheduling problems of minimizing the makespan are solved by the proposed method and the results are reported. [PUBLICATION ABSTRACT]
Author Ohta, Hiroshi
Nakatani, Toshihiro
Author_xml – sequence: 1
  givenname: Hiroshi
  surname: Ohta
  fullname: Ohta, Hiroshi
  email: ohta@ie.osakafu-u.ac.jp
– sequence: 2
  givenname: Toshihiro
  surname: Nakatani
  fullname: Nakatani, Toshihiro
BackLink http://econpapers.repec.org/article/eeeproeco/v_3a101_3ay_3a2006_3ai_3a1_3ap_3a19-29.htm$$DView record in RePEc
BookMark eNp9UcFq3DAQFSGFbNL-QE6id29lS15Z0EsIbRoI9JK7kKXZWMaWHEkObD-hX90x2156CMzoDWLem-HNNbkMMQAhtzXb16w-fBn3flxg3zDW7rdg4oLs6k7ySrZSXZIdU01btY3kV-Q655ExJuuu25Hfd3SANflcvKVj7Ks8xIVmO4BbJx9eqJleYvJlmGmJdPbBz_4X0DJgxmImOsTJbX025kLjEXFeJijgqAmO-lAtKVrImSK61ZZM89qPYMumFyItJrnTNjl_JB-OZsrw6S_ekOfv357vf1RPPx8e7--eKisaUSrbH1reN66VhkvBHQBrOTDXK84PjnVGdEqAciCYkKo3qjaAheiVlebI-A35fJbFhV5XyEWPcU0BJ-padUpJ9AabHs9NCRawekl-NumkAQBZYKN-09yg8_ieMNH3A4LfPjGXDZVulB7KjFrdWcummHOCo7a-mOJjKMn4SddMbzfUo95uqLcb6i2YQGrzH_XfJu-Svp5JgCa-eUg6Ww_BgvMJfdcu-vfofwDgrLoh
CODEN IJPCEY
CitedBy_id crossref_primary_10_7763_IJCCE_2013_V2_174
crossref_primary_10_1007_s10951_012_0270_4
crossref_primary_10_1007_s00170_008_1781_1
crossref_primary_10_1016_j_ejor_2018_01_027
crossref_primary_10_1016_j_eswa_2010_08_006
crossref_primary_10_4028_www_scientific_net_AMM_591_176
Cites_doi 10.1287/opre.40.1.113
10.1287/mnsc.33.8.1035
10.1057/jors.1992.162
10.1016/0377-2217(94)90379-4
10.1287/mnsc.34.3.391
10.1287/mnsc.35.2.164
10.1016/0377-2217(93)90163-H
10.1080/00207549008942866
10.1287/ijoc.3.2.149
10.1016/0925-5273(95)00090-9
ContentType Journal Article
Copyright 2005 Elsevier B.V.
Copyright Elsevier Sequoia S.A. May 2006
Copyright_xml – notice: 2005 Elsevier B.V.
– notice: Copyright Elsevier Sequoia S.A. May 2006
DBID AAYXX
CITATION
DKI
X2L
7TA
7TB
8FD
FR3
JG9
KR7
DOI 10.1016/j.ijpe.2005.05.004
DatabaseName CrossRef
RePEc IDEAS
RePEc
Materials Business File
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Materials Research Database
Civil Engineering Abstracts
DatabaseTitle CrossRef
Materials Research Database
Civil Engineering Abstracts
Engineering Research Database
Technology Research Database
Mechanical & Transportation Engineering Abstracts
Materials Business File
DatabaseTitleList
Materials Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Business
EISSN 1873-7579
EndPage 29
ExternalDocumentID 954623311
eeeproeco_v_3a101_3ay_3a2006_3ai_3a1_3ap_3a19_29_htm
10_1016_j_ijpe_2005_05_004
S0925527305001301
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29J
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFFL
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAPFB
AAQFI
AAQXK
AARIN
AAXUO
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACGOD
ACIWK
ACNNM
ACRLP
ACROA
ADBBV
ADEZE
ADFHU
ADMUD
ADTZH
AEBSH
AECPX
AEFWE
AEKER
AENEX
AEYQN
AFKWA
AFODL
AFTJW
AGHFR
AGTHC
AGUBO
AGYEJ
AHHHB
AHJVU
AI.
AIEXJ
AIIAU
AIKHN
AITUG
AJBFU
AJOXV
AJWLA
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
APLSM
ASPBG
AVWKF
AXJTR
AXLSJ
AZFZN
BEHZQ
BEZPJ
BGSCR
BJAXD
BKOJK
BKOMP
BLXMC
BNTGB
BPUDD
BULVW
BZJEE
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HLX
HVGLF
HZ~
IHE
IXIXF
J1W
JJJVA
KOM
LG8
LY1
LY7
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SBM
SDF
SDG
SDP
SDS
SES
SET
SEW
SPC
SPCBC
SSB
SSD
SSF
SST
SSZ
T5K
TAE
TN5
U5U
VH1
WUQ
YK3
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
02
0R
1
1AW
8P
AAPBV
ADALY
DKI
G-
HZ
IPNFZ
K
M
MS
PQEST
TAF
X
X2L
7TA
7TB
8FD
AGCQF
FR3
JG9
KR7
ID FETCH-LOGICAL-c424t-cb653b2d57a3743dee053e0db9336d08a4894e9de40479ba91ae4794b9c7af03
ISICitedReferencesCount 16
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000234645400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-5273
IngestDate Wed Aug 13 08:58:44 EDT 2025
Wed Aug 18 03:12:48 EDT 2021
Sat Nov 29 01:48:00 EST 2025
Tue Nov 18 21:57:10 EST 2025
Fri Feb 23 02:29:03 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Due-date constraints
Shifting bottleneck procedure
Heuristics
Holding cost
Job-shop scheduling
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c424t-cb653b2d57a3743dee053e0db9336d08a4894e9de40479ba91ae4794b9c7af03
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 198997000
PQPubID 45063
PageCount 11
ParticipantIDs proquest_journals_198997000
repec_primary_eeeproeco_v_3a101_3ay_3a2006_3ai_3a1_3ap_3a19_29_htm
crossref_citationtrail_10_1016_j_ijpe_2005_05_004
crossref_primary_10_1016_j_ijpe_2005_05_004
elsevier_sciencedirect_doi_10_1016_j_ijpe_2005_05_004
PublicationCentury 2000
PublicationDate 2006-05-01
PublicationDateYYYYMMDD 2006-05-01
PublicationDate_xml – month: 05
  year: 2006
  text: 2006-05-01
  day: 01
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationSeriesTitle International Journal of Production Economics
PublicationTitle International journal of production economics
PublicationYear 2006
Publisher Elsevier B.V
Elsevier
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier
– name: Elsevier Sequoia S.A
References Van Laarhoven, Aarts, Lenstra (bib11) 1992; 40
Asano, Ohta (bib4) 1996; 44
Anderson, Nyirenda (bib2) 1990; 28
Carlier, Pinson (bib5) 1989; 35
Liao, You (bib8) 1992; 43
Raman, Talbot (bib10) 1993; 69
Applegate, Cook (bib3) 1991; 3
Adams, Balas, Zawack (bib1) 1988; 34
Muth, Thompson (bib9) 1963
Vepsalainen, Morton (bib12) 1987; 33
Carlier, Pinson (bib6) 1994; 78
Lawrence (bib7) 1984
Muth (10.1016/j.ijpe.2005.05.004_bib9) 1963
Adams (10.1016/j.ijpe.2005.05.004_bib1) 1988; 34
Raman (10.1016/j.ijpe.2005.05.004_bib10) 1993; 69
Vepsalainen (10.1016/j.ijpe.2005.05.004_bib12) 1987; 33
Applegate (10.1016/j.ijpe.2005.05.004_bib3) 1991; 3
Carlier (10.1016/j.ijpe.2005.05.004_bib6) 1994; 78
Van Laarhoven (10.1016/j.ijpe.2005.05.004_bib11) 1992; 40
Lawrence (10.1016/j.ijpe.2005.05.004_bib7) 1984
Anderson (10.1016/j.ijpe.2005.05.004_bib2) 1990; 28
Liao (10.1016/j.ijpe.2005.05.004_bib8) 1992; 43
Asano (10.1016/j.ijpe.2005.05.004_bib4) 1996; 44
Carlier (10.1016/j.ijpe.2005.05.004_bib5) 1989; 35
References_xml – volume: 69
  start-page: 187
  year: 1993
  end-page: 199
  ident: bib10
  article-title: The job shop tardiness problem: A decomposition approach
  publication-title: European Journal of Operational Research
– year: 1984
  ident: bib7
  article-title: Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques
– volume: 34
  start-page: 391
  year: 1988
  end-page: 401
  ident: bib1
  article-title: The sifting bottleneck procedure for job shop scheduling problem
  publication-title: Management Science
– volume: 35
  start-page: 164
  year: 1989
  end-page: 176
  ident: bib5
  article-title: An algorithm for solving the job-shop problem
  publication-title: Management Science
– volume: 78
  start-page: 146
  year: 1994
  end-page: 161
  ident: bib6
  article-title: Adjustment of heads and tails for the job-shop problem
  publication-title: European Journal of Operational Research
– volume: 28
  start-page: 2277
  year: 1990
  end-page: 2292
  ident: bib2
  article-title: Two new rules to minimize tardiness in a job shop
  publication-title: International Journal of Production Research
– volume: 33
  start-page: 1035
  year: 1987
  end-page: 1047
  ident: bib12
  article-title: Priority rules for job shops with weighted tardiness costs
  publication-title: Management Science
– volume: 3
  start-page: 149
  year: 1991
  end-page: 156
  ident: bib3
  article-title: A computation study of the job-shop scheduling problem
  publication-title: ORSA Journal on Computing
– volume: 44
  start-page: 35
  year: 1996
  end-page: 43
  ident: bib4
  article-title: Single machine scheduling using dominance relation to minimize earliness subject to ready and due times
  publication-title: International Journal of Production Economics
– year: 1963
  ident: bib9
  article-title: Industrial Scheduling
– volume: 40
  start-page: 113
  year: 1992
  end-page: 125
  ident: bib11
  article-title: Job shop scheduling by simulated annealing
  publication-title: Operations Research
– volume: 43
  start-page: 1047
  year: 1992
  end-page: 1054
  ident: bib8
  article-title: An improved formulation for the job-shop scheduling problem
  publication-title: Journal of the Operational Research Society
– year: 1963
  ident: 10.1016/j.ijpe.2005.05.004_bib9
– volume: 40
  start-page: 113
  year: 1992
  ident: 10.1016/j.ijpe.2005.05.004_bib11
  article-title: Job shop scheduling by simulated annealing
  publication-title: Operations Research
  doi: 10.1287/opre.40.1.113
– volume: 33
  start-page: 1035
  year: 1987
  ident: 10.1016/j.ijpe.2005.05.004_bib12
  article-title: Priority rules for job shops with weighted tardiness costs
  publication-title: Management Science
  doi: 10.1287/mnsc.33.8.1035
– volume: 43
  start-page: 1047
  year: 1992
  ident: 10.1016/j.ijpe.2005.05.004_bib8
  article-title: An improved formulation for the job-shop scheduling problem
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/jors.1992.162
– volume: 78
  start-page: 146
  year: 1994
  ident: 10.1016/j.ijpe.2005.05.004_bib6
  article-title: Adjustment of heads and tails for the job-shop problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(94)90379-4
– year: 1984
  ident: 10.1016/j.ijpe.2005.05.004_bib7
– volume: 34
  start-page: 391
  year: 1988
  ident: 10.1016/j.ijpe.2005.05.004_bib1
  article-title: The sifting bottleneck procedure for job shop scheduling problem
  publication-title: Management Science
  doi: 10.1287/mnsc.34.3.391
– volume: 35
  start-page: 164
  year: 1989
  ident: 10.1016/j.ijpe.2005.05.004_bib5
  article-title: An algorithm for solving the job-shop problem
  publication-title: Management Science
  doi: 10.1287/mnsc.35.2.164
– volume: 69
  start-page: 187
  year: 1993
  ident: 10.1016/j.ijpe.2005.05.004_bib10
  article-title: The job shop tardiness problem: A decomposition approach
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(93)90163-H
– volume: 28
  start-page: 2277
  year: 1990
  ident: 10.1016/j.ijpe.2005.05.004_bib2
  article-title: Two new rules to minimize tardiness in a job shop
  publication-title: International Journal of Production Research
  doi: 10.1080/00207549008942866
– volume: 3
  start-page: 149
  year: 1991
  ident: 10.1016/j.ijpe.2005.05.004_bib3
  article-title: A computation study of the job-shop scheduling problem
  publication-title: ORSA Journal on Computing
  doi: 10.1287/ijoc.3.2.149
– volume: 44
  start-page: 35
  year: 1996
  ident: 10.1016/j.ijpe.2005.05.004_bib4
  article-title: Single machine scheduling using dominance relation to minimize earliness subject to ready and due times
  publication-title: International Journal of Production Economics
  doi: 10.1016/0925-5273(95)00090-9
SSID ssj0007188
Score 1.898784
Snippet Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop...
SourceID proquest
repec
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 19
SubjectTerms Benchmarks
Due-date constraints
Heuristic
Heuristics
Holding cost
Job shops
Job-shop scheduling
Management science
Production costs
Scheduling
Scheduling algorithms
Shifting bottleneck procedure
Title A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs
URI https://dx.doi.org/10.1016/j.ijpe.2005.05.004
http://econpapers.repec.org/article/eeeproeco/v_3a101_3ay_3a2006_3ai_3a1_3ap_3a19-29.htm
https://www.proquest.com/docview/198997000
Volume 101
WOSCitedRecordID wos000234645400003&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-7579
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007188
  issn: 0925-5273
  databaseCode: AIEXJ
  dateStart: 19950301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5FDUJwQFBADQW0B26WkRvbsfcYUFFBqHDIIbfV2l5jh8S2Yicq_AR-CT-TGe8jaVArekCKH_JjbWe-3fk8ngchb9gZE6BnEzcQ-JlRssxNIl-6oLujPIc9UlUt-RxdXsbzOfs6GPw2sTDbZVRV8dUVa_6rqGEbCBtDZ-8gbtsobIB1EDrMQeww_yfBT4H8bVT-ZWdRJ25b1I0D77CgU_rQc7H8Vq_Lrlgh7cTMIqvyp-z5Z1f3kZHqe5ST1m1nnc4lElOVqMltVGwBunZhstjWaTcJWnOwvQqYLPoC4JXbfeJ73fK4l69Ct4IolDpI2tL8L4Xithcl6PKitIZr8V10qhaVM8MdBew_NF8YZ0FjhxyHLmaBuzYk746w2FMDrB5flapWtpK_lICyRyzelotGaqsZGs6Cncozn_kPNKH1TzSubwuObWCpzpDjDxPPDsdRyGD8HE4_ns8_Wa0POr7X-uZxdICW8iU8vJObSNDeS85wLRuZ7nGd2WPySL-k0KkC1xMykNUxuW9iJI7Jw70slk_Jrym1iKMGcXSHOGoRR7uaGsRRQBztEUc14igijtY5tYijgDi6Qxw1iKMacdheVdMecXjl9hmZfTifvb9wdYkPNw3GQeemyST0k3EWRsIHLptJrFQivSxhvj_JvFgEMcMBRAZYCiER7ExIrImQsDQSuec_J0dVXckTQqMARpw8FmEicqD4CfOCTHhxIsM08iepNyJn5i_nqU5_j1VYlvxmYY-IY89pVPKXW48OjSS5pq-KlnIA5q3nnRqxc939Wo6ujCwCXI3Iux4J9gaklHA49Ei-5b6ANmH-AybsXLAocSNMDS4ZHzNedKsXd3qQU_Jg11NfkqNuvZGvyL1025Xt-rUG_h8N3ORX
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=A+heuristic+job-shop+scheduling+algorithm+to+minimize+the+total+holding+cost+of+completed+and+in-process+products+subject+to+no+tardy+jobs&rft.jtitle=International+journal+of+production+economics&rft.au=Ohta%2C+Hiroshi&rft.au=Nakatani%2C+Toshihiro&rft.date=2006-05-01&rft.issn=0925-5273&rft.volume=101&rft.issue=1&rft.spage=19&rft.epage=29&rft_id=info:doi/10.1016%2Fj.ijpe.2005.05.004&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ijpe_2005_05_004
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5273&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5273&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5273&client=summon