ABSTRACT
Abstract In this chapter, we address scheduling problems with independent jobs on a single machine or on parallel identical machines. The jobs are either sequential or parallel, that is, they may require concurrent access to several machines at the same time. Our objectives, like the makespan or the total weighted completion time, are commonly used in scheduling literature. We consider deterministic and online problems. Our focus is on simple algorithms, like various forms of List Scheduling, that provide optimal or good solutions based on an evaluation with approximation or competitive factors. With the help of some example schedules and exemplary proofs, we explain common approaches to address this kind of problems.
