Publisher Summary This chapter discusses different types of sequencing and scheduling
problems, and describes different types of algorithms and the concepts of complexity theory …

We consider the problem of scheduling n jobs to minimize the total earliness and tardiness
penalty. We review the literature on this topic, providing a framework to show how results …

Scheduling and multicriteria optimisation theory have been subject, separately, to numerous
studies. Since the last twenty years, multicriteria scheduling problems have been subject to …

We aim at providing a unified framework of the common due date assignment and
scheduling problems in the deterministic case by surveying the literature concerning the …

In this paper we give a survey of the most important results on multicriteria scheduling that
have appeared in the literature or are to appear. We provide an extensive introduction …

The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …

In this research, a parallel machine sequence-dependent group scheduling problem with
the goal of minimizing total weighted earliness and tardiness is investigated. First, a …

This paper and its companion (Part II) concern the scheduling of jobs with cost penalties for
both early and late completion. In Part I, we consider the problem of minimizing the weighted …

A companion paper (Part I) considers the problem of minimizing the weighted earliness and
tardiness of jobs scheduled on a single machine around a common due date, d, which is …

Local search has been applied successfully to a diverse collection of optimization problems.
It's appreciated for its basic conceptual foundation, its general applicability, and its power to …