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

<table>The partial schedule <svg height="6.61354pt" id="M265" style="vertical-align:-0.2130003pt" version="1.1" viewbox="-0.0498162 -6.40054 7.78305 6.61354" width="7.78305pt" 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="M548 455L523 469C505 448 490 439 461 439C416 439 374 447 316 447C144 447 23 310 23 161C23 47 89 -12 179 -12C312 -12 429 106 429 244C429 303 419 344 368 386L371 388C404 383 440 378 474 378C507 378 530 411 548 455ZM350 274C350 191 308 25 198 25C144 25 108 75 108 157C108 264 170 395 276 395C296 395 320 384 333 360C347 334 350 316 350 274Z" id="g113-240"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="565" vert-adv-y="565"></glyph.data></g></svg><i>.</i></table>

Journal of Industrial Engineering

fig2

Figure 2

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