Note on a Single-Machine Scheduling Problem with Sum of Processing Times Based Learning and Ready Times

<div>The performance of branch-and-bound algorithm over <svg height="9.49473pt" id="M135" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 7.55047 9.49473" width="7.55047pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M547 100L523 123C489 76 461 62 452 62C442 62 433 71 427 109C405 243 387 408 378 495C360 666 322 710 263 710C230 710 182 688 161 667L170 639C184 646 203 651 218 651C247 651 272 634 288 562C297 521 300 485 304 436C230 267 111 104 24 11L33 -12L116 6C163 73 263 255 311 362L347 84C355 26 373 -12 406 -12C440 -12 489 12 547 100Z" id="g50-233"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="571" vert-adv-y="571"></glyph.data></g></svg> and <svg height="6.20645pt" id="M136" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -6.00005 6.80667 6.20645" width="6.80667pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M490 97L476 124C442 96 405 70 398 70C392 70 390 78 396 114C419 243 448 379 463 432L457 436C446 436 431 439 418 442C393 447 368 451 343 451C281 451 204 418 155 381C74 320 24 206 24 107C24 23 59 -12 88 -12C118 -12 155 5 191 34C236 70 290 122 328 177H330L312 84C296 0 311 -12 331 -12C355 -12 425 24 490 97ZM374 387C371 367 360 299 347 264C323 202 187 53 142 53C128 53 113 73 113 120C113 224 157 332 221 380C241 395 274 403 303 403C330 403 360 395 374 387Z" id="g50-98"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="514" vert-adv-y="514"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig2

Figure 2

Figure 2: Note on a Single-Machine Scheduling Problem with Sum of Processing Times Based Learning and Ready Times 