A binary branch and bound algorithm to minimize maximum scheduling cost

This paper examines a single machine scheduling problem of minimizing the maximum scheduling cost that is nondecreasing with job completion time. Job release dates and precedence constraints are considered. We assume that each job can be processed exactly once without preemption. This is a classical...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Omega (Oxford) Ročník 42; číslo 1; s. 9 - 15
Hlavní autori:	Chandra, Charu, Liu, Zhixin, He, Jun, Ruohonen, Toni
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier Ltd 01.01.2014 Pergamon Press Inc
Predmet:	Algorithms Branch & bound algorithms Branch and bound Cost reduction Health service Heuristic Job shops Manufacturing Mathematical problems Optimization algorithms Production scheduling Scheduling Studies Scheduling Health service Manufacturing Branch and bound
ISSN:	0305-0483, 1873-5274
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	This paper examines a single machine scheduling problem of minimizing the maximum scheduling cost that is nondecreasing with job completion time. Job release dates and precedence constraints are considered. We assume that each job can be processed exactly once without preemption. This is a classical scheduling problem, and is specifically useful in the scheduling of medical treatments. We develop a simple branch and bound algorithm to solve the scheduling problem optimally. A binary branching technique is developed. We use a preemptive solution approach to locate a lower bound, and design a simple heuristic to find an upper bound. Our algorithm is easy to implement and finds optimal schedules in one CPU minute for almost all instances tested, with up to 1000 jobs. ► Minimizes maximum scheduling cost, with release dates and precedence constraints. ► Applicable in scheduling of medical treatments. ► Develops an easy-to-implement branch and bound algorithm. ► Optimally solves almost all random instances with up to 1000 jobs in one CPU minute.
AbstractList	This paper examines a single machine scheduling problem of minimizing the maximum scheduling cost that is nondecreasing with job completion time. Job release dates and precedence constraints are considered. We assume that each job can be processed exactly once without preemption. This is a classical scheduling problem, and is specifically useful in the scheduling of medical treatments. We develop a simple branch and bound algorithm to solve the scheduling problem optimally. A binary branching technique is developed. We use a preemptive solution approach to locate a lower bound, and design a simple heuristic to find an upper bound. Our algorithm is easy to implement and finds optimal schedules in one CPU minute for almost all instances tested, with up to 1000 jobs. ► Minimizes maximum scheduling cost, with release dates and precedence constraints. ► Applicable in scheduling of medical treatments. ► Develops an easy-to-implement branch and bound algorithm. ► Optimally solves almost all random instances with up to 1000 jobs in one CPU minute. This paper examines a single machine scheduling problem of minimizing the maximum scheduling cost that is nondecreasing with job completion time. Job release dates and precedence constraints are considered. We assume that each job can be processed exactly once without preemption. This is a classical scheduling problem, and is specifically useful in the scheduling of medical treatments. We develop a simple branch and bound algorithm to solve the scheduling problem optimally. A binary branching technique is developed. We use a preemptive solution approach to locate a lower bound, and design a simple heuristic to find an upper bound. Our algorithm is easy to implement and finds optimal schedules in one CPU minute for almost all instances tested, with up to 1000 jobs. [PUBLICATION ABSTRACT]
Author	Ruohonen, Toni Liu, Zhixin Chandra, Charu He, Jun
Author_xml	– sequence: 1 givenname: Charu surname: Chandra fullname: Chandra, Charu organization: Department of Management Studies, College of Business, University of Michigan-Dearborn, 19000 Hubbard Drive, Dearborn, MI 48126, United States – sequence: 2 givenname: Zhixin surname: Liu fullname: Liu, Zhixin email: zhixin@umich.edu organization: Department of Management Studies, College of Business, University of Michigan-Dearborn, 19000 Hubbard Drive, Dearborn, MI 48126, United States – sequence: 3 givenname: Jun surname: He fullname: He, Jun organization: Department of Management Studies, College of Business, University of Michigan-Dearborn, 19000 Hubbard Drive, Dearborn, MI 48126, United States – sequence: 4 givenname: Toni surname: Ruohonen fullname: Ruohonen, Toni organization: Department of Mathematical Information Technology, University of Jyväskylä, Finland
BookMark	eNqFkLFOwzAQhi0EEm3hCVgsMSec4yRuB4aqgoJUiQVmy7Gd1lFiF9tBwNPjUiYGWO6W-_7T_03RqXVWI3RFICdA6psud4PeirwAQnMocoDqBE3InNGsKlh5iiZAocqgnNNzNA2hAwAyBzpB6yVujBX-AzdeWLnDwircuDFN0W-dN3E34OjwYKwZzKfGg3g3wzjgIHdajb2xWyxdiBforBV90Jc_e4Ze7u-eVw_Z5mn9uFpuMknrImYVE7ViQkmQpW7lQrYlVS0ptSQEKF1o0haiamRVF5TWSjBFmGK0XaimIVQTOkPXx9y9d6-jDpF3bvQ2veSkpKxIbRM5Q_R4Jb0LweuW770ZUktOgB-M8Y5_G-MHYxwKnowlavGLkiaKaJyNXpj-H_b2yOpU_s1oz4M02kqtjNcycuXMn_wX_jaKmA
CODEN	OMEGA6
CitedBy_id	crossref_primary_10_1016_j_omega_2013_08_003 crossref_primary_10_1007_s00500_015_1908_x crossref_primary_10_1007_s10479_023_05769_6 crossref_primary_10_1016_j_cie_2013_10_013 crossref_primary_10_1007_s40314_016_0370_4 crossref_primary_10_1016_j_omega_2018_04_003 crossref_primary_10_1061__ASCE_TE_1943_5436_0000659 crossref_primary_10_1016_j_omega_2013_11_004 crossref_primary_10_1016_j_cor_2024_106759 crossref_primary_10_1007_s10696_018_9316_z crossref_primary_10_1016_j_ejor_2021_03_047 crossref_primary_10_1016_j_omega_2014_07_005 crossref_primary_10_1007_s10878_015_9973_8 crossref_primary_10_1016_j_energy_2025_137344 crossref_primary_10_1109_ACCESS_2019_2904139 crossref_primary_10_1016_j_ejor_2017_01_004 crossref_primary_10_3390_pr10112223
Cites_doi	10.1016/0377-2217(86)90191-8 10.1287/ijoc.1060.0209 10.1016/S0167-5060(08)70743-X 10.1287/opre.28.4.942 10.1287/opre.28.6.1436 10.1007/s10479-007-0283-0 10.1007/s10951-008-0067-7 10.1016/j.omega.2011.12.002 10.1287/opre.23.3.475 10.1016/S0377-2217(82)80007-6 10.1287/opre.31.2.381 10.1287/opre.49.6.854.10014 10.1287/mnsc.19.5.544 10.1287/mnsc.44.2.262 10.1016/j.cor.2005.11.010 10.1016/j.omega.2012.01.002 10.1287/mnsc.42.8.1165 10.1137/0206029 10.1287/opre.1090.0744 10.1287/opre.18.2.263 10.1016/j.omega.2010.06.006 10.1016/0166-218X(89)90036-X 10.1016/j.cor.2009.11.008 10.1002/nav.3800210112 10.1016/S0167-5060(08)70356-X 10.1016/0377-2217(86)90247-X 10.1287/opre.1030.0092 10.1111/j.1467-9574.1976.tb00264.x 10.1287/moor.17.1.22
ContentType	Journal Article
Copyright	2013 Elsevier Ltd Copyright Pergamon Press Inc. Jan 2014
Copyright_xml	– notice: 2013 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Jan 2014
DBID	AAYXX CITATION K9.
DOI	10.1016/j.omega.2013.02.005
DatabaseName	CrossRef ProQuest Health & Medical Complete (Alumni)
DatabaseTitle	CrossRef ProQuest Health & Medical Complete (Alumni)
DatabaseTitleList	ProQuest Health & Medical Complete (Alumni)
DeliveryMethod	fulltext_linktorsrc
Discipline	Business
EISSN	1873-5274
EndPage	15
ExternalDocumentID	3083545801 10_1016_j_omega_2013_02_005 S0305048313000200
Genre	Feature
GroupedDBID	--K --M -~X .~1 0R~ 13V 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 5VS 7-5 71M 8P~ 96U 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABJNI ABKBG ABMAC ABMVD ABUCO ABXDB ABYKQ ACBMB ACDAQ ACGFS ACHQT ACHRH ACNCT ACNTT ACRLP ADBBV ADEZE ADIYS ADMUD AEBSH AEKER AENEX AFACB AFAZI AFFNX AFKWA AFTJW AGHFR AGJBL AGQRV AGUBO AGUMN AGYEJ AHEHV AHHHB AHMBA AIEXJ AIKHN AITUG AJBFU AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ASPBG AVWKF AXJTR AZFZN BAAKF BDEBP BKOJK BKOMP BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA HAMUX HVGLF HZ~ IAO IEA IGG IHE IHR IOF IPO ITC J1W KOM LPU LXL LY1 M41 MO0 MS~ N95 O-L O9- OAUVE OHT OZT P-8 P-9 PC. PQQKQ Q38 R2- RIG ROL RPZ SDF SDG SDP SDS SES SEW SPCBC SSB SSD SSL SSZ T5K TAE TAF TN5 U5U VQA WUQ XI7 XPP XSW XYO YNT ZRQ ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADMHG ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS IPC ~HD K9.
ID	FETCH-LOGICAL-c362t-57a6d7adc0c4efc9cf43df14ec110339e1f2a5bc562336da7d17d73f9dbb13e13
ISICitedReferencesCount	22
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000325953500002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0305-0483
IngestDate	Tue Oct 07 05:14:54 EDT 2025 Sat Nov 29 04:12:48 EST 2025 Tue Nov 18 22:11:29 EST 2025 Fri Feb 23 02:30:29 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Scheduling Health service Manufacturing Branch and bound
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c362t-57a6d7adc0c4efc9cf43df14ec110339e1f2a5bc562336da7d17d73f9dbb13e13
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
PQID	1437227423
PQPubID	46729
PageCount	7
ParticipantIDs	proquest_journals_1437227423 crossref_primary_10_1016_j_omega_2013_02_005 crossref_citationtrail_10_1016_j_omega_2013_02_005 elsevier_sciencedirect_doi_10_1016_j_omega_2013_02_005
PublicationCentury	2000
PublicationDate	January 2014 2014-01-00 20140101
PublicationDateYYYYMMDD	2014-01-01
PublicationDate_xml	– month: 01 year: 2014 text: January 2014
PublicationDecade	2010
PublicationPlace	Oxford
PublicationPlace_xml	– name: Oxford
PublicationTitle	Omega (Oxford)
PublicationYear	2014
Publisher	Elsevier Ltd Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Pergamon Press Inc
References	Schrage (bib29) 1970; 18 Hall, Posner (bib14) 2001; 49 Lawler (bib17) 1973; 19 Maenhout, Vanhoucke (bib22) 2013; 41 Monma (bib24) 1980; 28 Pinedo (bib26) 2002 Leung, Pinedo, Wan (bib20) 2010; 58 Schutten, van de Velde, Zijm (bib28) 1996; 42 Kopanos, Puigjaner, Georgiadis (bib16) 2012; 40 McMahon, Florian (bib23) 1975; 23 Sterna (bib30) 2011; 39 Tang, Wang, Liu (bib31) 2007; 34 Balas, Vazacopoulos (bib6) 1998; 44 Graham, Lawler, Lenstra, Rinnooy Kan (bib12) 1979; 5 Lenstra, Rinnooy Kan, Brucker (bib19) 1977; 1 Liu (bib21) 2010; 37 Hall, Shmoys (bib15) 1992; 1 Brucker (bib8) 1998 Potts (bib27) 1980; 28 Baker, Su (bib5) 1974; 21 Garey, Johnson (bib10) 1977; 6 Nowicki, Zdrzalka (bib25) 1986; 23 Artigues, Feillet (bib2) 2008; 159 Hall, Liu, Potts (bib13) 2007; 19 Carlier (bib9) 1982; 11 Lageweg, Lenstra, Rinnooy Kan (bib18) 1976; 30 Grabowski, Nowicki, Zdrzalka (bib11) 1986; 26 Baker (bib3) 1974 Baker, Lawler, Lenstra, Rinnooy Kan (bib4) 1983; 31 Balas, Simonetti, Vazacopoulos (bib7) 2008; 11 Zdrzalka, Grabowski (bib32) 1989; 23 Agnetis, Mirchandani, Pacciarelli, Pacifici (bib1) 2004; 52 Nowicki (10.1016/j.omega.2013.02.005_bib25) 1986; 23 Baker (10.1016/j.omega.2013.02.005_bib3) 1974 Lawler (10.1016/j.omega.2013.02.005_bib17) 1973; 19 Schutten (10.1016/j.omega.2013.02.005_bib28) 1996; 42 Zdrzalka (10.1016/j.omega.2013.02.005_bib32) 1989; 23 Kopanos (10.1016/j.omega.2013.02.005_bib16) 2012; 40 Lageweg (10.1016/j.omega.2013.02.005_bib18) 1976; 30 Garey (10.1016/j.omega.2013.02.005_bib10) 1977; 6 Tang (10.1016/j.omega.2013.02.005_bib31) 2007; 34 Maenhout (10.1016/j.omega.2013.02.005_bib22) 2013; 41 Potts (10.1016/j.omega.2013.02.005_bib27) 1980; 28 Pinedo (10.1016/j.omega.2013.02.005_bib26) 2002 McMahon (10.1016/j.omega.2013.02.005_bib23) 1975; 23 Hall (10.1016/j.omega.2013.02.005_bib13) 2007; 19 Monma (10.1016/j.omega.2013.02.005_bib24) 1980; 28 Agnetis (10.1016/j.omega.2013.02.005_bib1) 2004; 52 Balas (10.1016/j.omega.2013.02.005_bib6) 1998; 44 Lenstra (10.1016/j.omega.2013.02.005_bib19) 1977; 1 Baker (10.1016/j.omega.2013.02.005_bib5) 1974; 21 Balas (10.1016/j.omega.2013.02.005_bib7) 2008; 11 Leung (10.1016/j.omega.2013.02.005_bib20) 2010; 58 Sterna (10.1016/j.omega.2013.02.005_bib30) 2011; 39 Baker (10.1016/j.omega.2013.02.005_bib4) 1983; 31 Carlier (10.1016/j.omega.2013.02.005_bib9) 1982; 11 Hall (10.1016/j.omega.2013.02.005_bib14) 2001; 49 Hall (10.1016/j.omega.2013.02.005_bib15) 1992; 1 Brucker (10.1016/j.omega.2013.02.005_bib8) 1998 Graham (10.1016/j.omega.2013.02.005_bib12) 1979; 5 Schrage (10.1016/j.omega.2013.02.005_bib29) 1970; 18 Liu (10.1016/j.omega.2013.02.005_bib21) 2010; 37 Artigues (10.1016/j.omega.2013.02.005_bib2) 2008; 159 Grabowski (10.1016/j.omega.2013.02.005_bib11) 1986; 26
References_xml	– volume: 26 start-page: 278 year: 1986 end-page: 285 ident: bib11 article-title: A block approach for single-machine scheduling with release dates and due dates publication-title: European Journal of Operational Research – year: 2002 ident: bib26 article-title: Scheduling – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: bib12 article-title: Optimization and approximation in deterministic machine scheduling publication-title: Annals of Discrete Mathematics – volume: 28 start-page: 1436 year: 1980 end-page: 1441 ident: bib27 article-title: Analysis of a heuristic for one machine with release dates and delivery times publication-title: Operations Research – volume: 31 start-page: 381 year: 1983 end-page: 386 ident: bib4 article-title: Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints publication-title: Operations Research – volume: 42 start-page: 1165 year: 1996 end-page: 1174 ident: bib28 article-title: Single machine scheduling with release dates due dates, and family setup times publication-title: Management Science – volume: 40 start-page: 634 year: 2012 end-page: 650 ident: bib16 article-title: Simultaneous production and logistics operations planning in semicontinuous food industries publication-title: Omega – volume: 23 start-page: 266 year: 1986 end-page: 267 ident: bib25 article-title: A note on minimizing maximum lateness in a one-machine sequencing problem with release dates publication-title: European Journal of Operational Research – volume: 21 start-page: 171 year: 1974 end-page: 176 ident: bib5 article-title: Sequencing with due dates and early start times to minimize tardiness publication-title: Naval Research Logistics Quarterly – volume: 11 start-page: 253 year: 2008 end-page: 262 ident: bib7 article-title: Job shop scheduling with setup times, deadlines and precedence constraints publication-title: Journal of Scheduling – year: 1998 ident: bib8 article-title: Scheduling algorithms – volume: 37 start-page: 1537 year: 2010 end-page: 1543 ident: bib21 article-title: Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints publication-title: Computers & Operations Research – volume: 11 start-page: 42 year: 1982 end-page: 47 ident: bib9 article-title: The one-machine sequencing problem publication-title: European Journal of Operational Research – volume: 1 start-page: 343 year: 1977 end-page: 362 ident: bib19 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics – volume: 44 start-page: 262 year: 1998 end-page: 275 ident: bib6 article-title: A guided local search with shifting bottleneck for job shop scheduling publication-title: Management Science – volume: 159 start-page: 135 year: 2008 end-page: 159 ident: bib2 article-title: A branch and bound method for the job-shop problem with sequence-dependent setup times publication-title: Annals of Operations Research – volume: 18 start-page: 263 year: 1970 end-page: 278 ident: bib29 article-title: Solving resource-constrained network problems by implicit enumeration publication-title: Operations Research – volume: 39 start-page: 120 year: 2011 end-page: 129 ident: bib30 article-title: A survey of scheduling problems with late work criteria publication-title: Omega – volume: 19 start-page: 633 year: 2007 end-page: 645 ident: bib13 article-title: Rescheduling for multiple new orders publication-title: INFORMS Journal on Computing – volume: 23 start-page: 475 year: 1975 end-page: 482 ident: bib23 article-title: On scheduling with ready times and due dates to minimize maximum lateness publication-title: Operations Research – year: 1974 ident: bib3 article-title: Introduction to sequencing and scheduling – volume: 6 start-page: 416 year: 1977 end-page: 426 ident: bib10 article-title: Two-processor scheduling with starting time and deadlines publication-title: SIAM Journal on Computing – volume: 34 start-page: 3001 year: 2007 end-page: 3015 ident: bib31 article-title: A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry publication-title: Computers & Operations Research – volume: 52 start-page: 229 year: 2004 end-page: 242 ident: bib1 article-title: Scheduling problems with two competing agents publication-title: Operations Research – volume: 1 start-page: 22 year: 1992 end-page: 35 ident: bib15 article-title: Jackson's rule for single-machine scheduling publication-title: Mathematics of Operations Research – volume: 58 start-page: 458 year: 2010 end-page: 469 ident: bib20 article-title: Competitive two-agent scheduling and its applications publication-title: Operations Research – volume: 49 start-page: 854 year: 2001 end-page: 865 ident: bib14 article-title: Generating experimental data for computational testing with machine scheduling applications publication-title: Operations Research – volume: 41 start-page: 485 year: 2013 end-page: 499 ident: bib22 article-title: An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems publication-title: Omega – volume: 28 start-page: 942 year: 1980 end-page: 951 ident: bib24 article-title: Sequencing to minimize the maximum job cost publication-title: Operations Research – volume: 23 start-page: 73 year: 1989 end-page: 89 ident: bib32 article-title: An algorithm for single machine sequencing with release dates to minimize maximum cost publication-title: Discrete Applied Mathematics – volume: 19 start-page: 544 year: 1973 end-page: 546 ident: bib17 article-title: Optimal sequencing of a single machine subjects to precedence constraints publication-title: Management Science – volume: 30 start-page: 25 year: 1976 end-page: 41 ident: bib18 article-title: Minimizing maximum lateness on one machine publication-title: Statistical Neerlandica – volume: 26 start-page: 278 year: 1986 ident: 10.1016/j.omega.2013.02.005_bib11 article-title: A block approach for single-machine scheduling with release dates and due dates publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(86)90191-8 – volume: 19 start-page: 633 year: 2007 ident: 10.1016/j.omega.2013.02.005_bib13 article-title: Rescheduling for multiple new orders publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1060.0209 – volume: 1 start-page: 343 year: 1977 ident: 10.1016/j.omega.2013.02.005_bib19 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70743-X – volume: 28 start-page: 942 year: 1980 ident: 10.1016/j.omega.2013.02.005_bib24 article-title: Sequencing to minimize the maximum job cost publication-title: Operations Research doi: 10.1287/opre.28.4.942 – volume: 28 start-page: 1436 year: 1980 ident: 10.1016/j.omega.2013.02.005_bib27 article-title: Analysis of a heuristic for one machine with release dates and delivery times publication-title: Operations Research doi: 10.1287/opre.28.6.1436 – volume: 159 start-page: 135 year: 2008 ident: 10.1016/j.omega.2013.02.005_bib2 article-title: A branch and bound method for the job-shop problem with sequence-dependent setup times publication-title: Annals of Operations Research doi: 10.1007/s10479-007-0283-0 – volume: 11 start-page: 253 year: 2008 ident: 10.1016/j.omega.2013.02.005_bib7 article-title: Job shop scheduling with setup times, deadlines and precedence constraints publication-title: Journal of Scheduling doi: 10.1007/s10951-008-0067-7 – volume: 40 start-page: 634 year: 2012 ident: 10.1016/j.omega.2013.02.005_bib16 article-title: Simultaneous production and logistics operations planning in semicontinuous food industries publication-title: Omega doi: 10.1016/j.omega.2011.12.002 – volume: 23 start-page: 475 year: 1975 ident: 10.1016/j.omega.2013.02.005_bib23 article-title: On scheduling with ready times and due dates to minimize maximum lateness publication-title: Operations Research doi: 10.1287/opre.23.3.475 – volume: 11 start-page: 42 year: 1982 ident: 10.1016/j.omega.2013.02.005_bib9 article-title: The one-machine sequencing problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(82)80007-6 – volume: 31 start-page: 381 year: 1983 ident: 10.1016/j.omega.2013.02.005_bib4 article-title: Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints publication-title: Operations Research doi: 10.1287/opre.31.2.381 – year: 1974 ident: 10.1016/j.omega.2013.02.005_bib3 – volume: 49 start-page: 854 year: 2001 ident: 10.1016/j.omega.2013.02.005_bib14 article-title: Generating experimental data for computational testing with machine scheduling applications publication-title: Operations Research doi: 10.1287/opre.49.6.854.10014 – volume: 19 start-page: 544 year: 1973 ident: 10.1016/j.omega.2013.02.005_bib17 article-title: Optimal sequencing of a single machine subjects to precedence constraints publication-title: Management Science doi: 10.1287/mnsc.19.5.544 – volume: 44 start-page: 262 year: 1998 ident: 10.1016/j.omega.2013.02.005_bib6 article-title: A guided local search with shifting bottleneck for job shop scheduling publication-title: Management Science doi: 10.1287/mnsc.44.2.262 – volume: 34 start-page: 3001 year: 2007 ident: 10.1016/j.omega.2013.02.005_bib31 article-title: A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry publication-title: Computers & Operations Research doi: 10.1016/j.cor.2005.11.010 – volume: 41 start-page: 485 year: 2013 ident: 10.1016/j.omega.2013.02.005_bib22 article-title: An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems publication-title: Omega doi: 10.1016/j.omega.2012.01.002 – volume: 42 start-page: 1165 year: 1996 ident: 10.1016/j.omega.2013.02.005_bib28 article-title: Single machine scheduling with release dates due dates, and family setup times publication-title: Management Science doi: 10.1287/mnsc.42.8.1165 – volume: 6 start-page: 416 year: 1977 ident: 10.1016/j.omega.2013.02.005_bib10 article-title: Two-processor scheduling with starting time and deadlines publication-title: SIAM Journal on Computing doi: 10.1137/0206029 – volume: 58 start-page: 458 year: 2010 ident: 10.1016/j.omega.2013.02.005_bib20 article-title: Competitive two-agent scheduling and its applications publication-title: Operations Research doi: 10.1287/opre.1090.0744 – volume: 18 start-page: 263 year: 1970 ident: 10.1016/j.omega.2013.02.005_bib29 article-title: Solving resource-constrained network problems by implicit enumeration publication-title: Operations Research doi: 10.1287/opre.18.2.263 – volume: 39 start-page: 120 year: 2011 ident: 10.1016/j.omega.2013.02.005_bib30 article-title: A survey of scheduling problems with late work criteria publication-title: Omega doi: 10.1016/j.omega.2010.06.006 – volume: 23 start-page: 73 year: 1989 ident: 10.1016/j.omega.2013.02.005_bib32 article-title: An algorithm for single machine sequencing with release dates to minimize maximum cost publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(89)90036-X – volume: 37 start-page: 1537 year: 2010 ident: 10.1016/j.omega.2013.02.005_bib21 article-title: Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.11.008 – year: 2002 ident: 10.1016/j.omega.2013.02.005_bib26 – volume: 21 start-page: 171 year: 1974 ident: 10.1016/j.omega.2013.02.005_bib5 article-title: Sequencing with due dates and early start times to minimize tardiness publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800210112 – year: 1998 ident: 10.1016/j.omega.2013.02.005_bib8 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.omega.2013.02.005_bib12 article-title: Optimization and approximation in deterministic machine scheduling publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70356-X – volume: 23 start-page: 266 year: 1986 ident: 10.1016/j.omega.2013.02.005_bib25 article-title: A note on minimizing maximum lateness in a one-machine sequencing problem with release dates publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(86)90247-X – volume: 52 start-page: 229 year: 2004 ident: 10.1016/j.omega.2013.02.005_bib1 article-title: Scheduling problems with two competing agents publication-title: Operations Research doi: 10.1287/opre.1030.0092 – volume: 30 start-page: 25 year: 1976 ident: 10.1016/j.omega.2013.02.005_bib18 article-title: Minimizing maximum lateness on one machine publication-title: Statistical Neerlandica doi: 10.1111/j.1467-9574.1976.tb00264.x – volume: 1 start-page: 22 year: 1992 ident: 10.1016/j.omega.2013.02.005_bib15 article-title: Jackson's rule for single-machine scheduling publication-title: Mathematics of Operations Research doi: 10.1287/moor.17.1.22
SSID	ssj0001803
Score	2.1872509
Snippet	This paper examines a single machine scheduling problem of minimizing the maximum scheduling cost that is nondecreasing with job completion time. Job release...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	9
SubjectTerms	Algorithms Branch & bound algorithms Branch and bound Cost reduction Health service Heuristic Job shops Manufacturing Mathematical problems Optimization algorithms Production scheduling Scheduling Studies
Title	A binary branch and bound algorithm to minimize maximum scheduling cost
URI	https://dx.doi.org/10.1016/j.omega.2013.02.005 https://www.proquest.com/docview/1437227423
Volume	42
WOSCitedRecordID	wos000325953500002&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-5274 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001803 issn: 0305-0483 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6hFiEuiKcobdEeuAUjr9fPY4RaCkKFQ0C5Wfty4yq2q8SuLH49sw87oRERPXCxLMte2Z5vZ2Znv5lB6B1jSvqsgPlNWeSFHKYiYyL0Cr2-4IyHhdkx_fk1ubxM5_Psu6MVrU07gaSu077Pbv6rqOEaCFunzt5D3OOgcAHOQehwBLHD8Z8EP51wm2PLdc8Mm7jGdfOkCVteNauyXVTa4dQ1Raryl-av9mXVVRNY5oLZWdok3PUfIftvlbpipjBpb7nwY_RAJydI06rIbNx3I7-n7My2x6LsyxF-FzZe322Sz7pm0dRW8c1AuWyHIEi4FYJwqVeaARjajjSDWg2DHfhYHZltGVubyrmjxm1E4fpDoz9P8--oLawabazWsFN_x5iNFMOBvXadm0FyPUjuB7kpeHsYJFEGOvBw-vls_mW03CT1bTtt9zlDlSrDB9x5l795MndsunFUZk_RE7fCwFOLjGfogaqfo0dDgsML9GmKLUCwBQgGCWIDEDwCBLcNHgCCHUDwBiBYA-Ql-nF-Nvt44bl2Gp4AL6X1ooTFMmFS-CJUhchEEVJZkFAJcAEpzRQpAhZxoT1iGkuWSJLIhBaZ5JxQRegrdFADKF4jTFLugwpKlfJhNseUxSSVhEsFzikVRXSEguHX5MLVmtctT5b5HrEcoffjQze21Mr-2-Phn-fOW7ReYA4o2v_gySCh3M3bNayAaRIY2sKb-73GMXq8mRIn6KBddeoUPRS3bblevXUI-w3zRpbE
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+binary+branch+and+bound+algorithm+to+minimize+maximum+scheduling+cost&rft.jtitle=Omega+%28Oxford%29&rft.au=Chandra%2C+Charu&rft.au=Liu%2C+Zhixin&rft.au=He%2C+Jun&rft.au=Ruohonen%2C+Toni&rft.date=2014-01-01&rft.issn=0305-0483&rft.volume=42&rft.issue=1&rft.spage=9&rft.epage=15&rft_id=info:doi/10.1016%2Fj.omega.2013.02.005&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_omega_2013_02_005
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0483&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0483&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0483&client=summon