Consider a single-machine, six-job, job sequencing problem such that all jobs have a ready time of zero and preempting jobs is not permitted. The remaining characteristics of the six jobs, listed in the order they were received, can be found in the table below. Determine and evaluate the job sequence that minimizes maximum lateness.