Minimizing the Number of Tardy Jobs on a Single Machine with an Availability Constraint

<table>(a) Solution obtained from the Moore and Hodgson algorithm for 1, <svg height="13.5205pt" id="M108" style="vertical-align:-3.4278pt" version="1.1" viewbox="-0.0498162 -10.0927 75.7392 13.5205" width="75.7392pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M499 88L487 113C459 86 422 65 413 65C403 65 403 74 409 98L461 318C487 426 460 448 431 448C408 448 383 441 352 424C305 398 223 344 157 257H155L243 674C249 702 249 712 240 712C227 712 170 680 87 673L82 648H117C155 648 162 644 150 590L23 -4L30 -12C55 -4 81 3 105 8C113 53 131 150 143 187C199 281 323 387 372 387C390 387 393 369 380 311L328 86C313 19 319 -12 347 -12C379 -12 442 24 499 88Z" id="g113-105"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="516" vert-adv-y="516"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,6.923,3.264)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z" id="g50-50"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,12.057,0)"><path d="M162 -163V703H101V-163H162Z" id="g113-9"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="263" vert-adv-y="263"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,15.62,0)"><path d="M169 380V459C122 440 66 423 24 416V392C86 384 90 382 90 317V-135C90 -201 81 -207 17 -213V-240H253V-213C176 -207 169 -201 169 -125V6C182 -1 208 -11 238 -12C368 12 487 109 487 260C487 358 421 449 310 449C298 449 279 444 261 433L169 380ZM169 346C196 367 237 389 269 389C341 389 403 329 403 221C403 109 347 37 263 37C228 37 191 53 169 76V346Z" id="g190-113"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="524" vert-adv-y="524"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,22.556,0)"><path d="M797 0V26C739 32 732 36 732 103V296C732 394 682 449 605 449C576 449 550 437 529 423C504 407 475 389 446 366C425 418 382 449 334 449C303 449 279 437 253 421C222 403 201 385 180 371V452C135 432 85 419 41 411V388C99 379 102 374 102 310V103C102 38 93 32 27 26V0H238V26C189 32 180 38 180 103V338C210 363 250 390 289 390C351 390 377 348 377 275V103C377 37 368 32 306 26V0H520V26C465 32 456 38 456 101V296C456 314 455 326 453 338C491 369 529 390 565 390C628 390 653 345 653 274V107C653 36 642 32 583 26V0H797Z" id="g190-110"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="819" vert-adv-y="819"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,33.394,0)"><path d="M298 36L289 62C276 55 253 45 228 45C202 45 169 60 169 141V397H276C289 405 292 426 282 437H169V574L155 576L90 509V437H45L17 408L21 397H90V107C90 28 125 -12 188 -12C198 -12 213 -8 230 1L298 36Z" id="g190-117"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="305" vert-adv-y="305"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,37.594,0)"><path d="M524 0V26C466 32 460 36 460 104V297C460 393 411 449 331 449C302 449 276 437 248 419C223 402 201 387 181 372V451C137 432 90 420 42 411V388C96 378 102 374 102 310V104C102 38 97 33 29 26V0H246V26C187 32 181 36 181 104V339C211 365 250 390 290 390C357 390 381 345 381 276V109C381 40 374 32 315 26V0H524Z" id="g190-111"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="547" vert-adv-y="547"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,45.116,0)"><path d="M162 -163V703H101V-163H162Z" id="g113-9"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="263" vert-adv-y="263"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,50.951,.007)"><path d="M697 -46L668 -39C637 -126 611 -142 545 -142H163L474 298L206 694H483C558 694 584 688 600 668C615 651 627 625 639 580L667 585L655 739H70V714L378 254L53 -203V-228H655L697 -46Z" id="g119-65"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="750" vert-adv-y="750"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,63.421,0)"><path d="M715 650H476L470 622C550 619 562 610 562 570C562 536 553 481 535 384L523 321C485 121 408 37 283 37C178 37 99 109 134 297L178 532C193 612 199 616 278 622L284 650H29L23 622C105 616 109 609 94 532L48 291C23 160 51 83 98 40C143 -1 202 -16 260 -16C321 -16 387 3 439 49C509 111 542 204 563 312L577 384C595 479 608 533 619 569C629 603 637 620 709 622L715 650Z" id="g113-86"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="727" vert-adv-y="727"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,72.39,3.264)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z" id="g50-106"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="280" vert-adv-y="280"></glyph.data></g></svg>. (b) Solution obtained from the Moore and Hodgson algorithm for 1, <svg height="13.5205pt" id="M109" style="vertical-align:-3.4278pt" version="1.1" viewbox="-0.0498162 -10.0927 46.243 13.5205" width="46.243pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M499 88L487 113C459 86 422 65 413 65C403 65 403 74 409 98L461 318C487 426 460 448 431 448C408 448 383 441 352 424C305 398 223 344 157 257H155L243 674C249 702 249 712 240 712C227 712 170 680 87 673L82 648H117C155 648 162 644 150 590L23 -4L30 -12C55 -4 81 3 105 8C113 53 131 150 143 187C199 281 323 387 372 387C390 387 393 369 380 311L328 86C313 19 319 -12 347 -12C379 -12 442 24 499 88Z" id="g113-105"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="516" vert-adv-y="516"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,6.923,3.264)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z" id="g50-50"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,12.057,0)"><path d="M162 -163V703H101V-163H162Z" id="g113-9"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="263" vert-adv-y="263"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,15.62,0)"><path d="M162 -163V703H101V-163H162Z" id="g113-9"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="263" vert-adv-y="263"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,21.454,.007)"><path d="M697 -46L668 -39C637 -126 611 -142 545 -142H163L474 298L206 694H483C558 694 584 688 600 668C615 651 627 625 639 580L667 585L655 739H70V714L378 254L53 -203V-228H655L697 -46Z" id="g119-65"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="750" vert-adv-y="750"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,33.925,0)"><path d="M715 650H476L470 622C550 619 562 610 562 570C562 536 553 481 535 384L523 321C485 121 408 37 283 37C178 37 99 109 134 297L178 532C193 612 199 616 278 622L284 650H29L23 622C105 616 109 609 94 532L48 291C23 160 51 83 98 40C143 -1 202 -16 260 -16C321 -16 387 3 439 49C509 111 542 204 563 312L577 384C595 479 608 533 619 569C629 603 637 620 709 622L715 650Z" id="g113-86"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="727" vert-adv-y="727"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,42.894,3.264)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z" id="g50-106"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="280" vert-adv-y="280"></glyph.data></g></svg>.</table>

Journal of Industrial Engineering

fig1

Figure 1

Figure 1: Minimizing the Number of Tardy Jobs on a Single Machine with an Availability Constraint 