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 …

Autonomous AI systems need complex computational techniques for planning and
performing actions. Planning and acting require significant deliberation because an …

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 …

We consider the formulation of non-preemptive single machine scheduling problems using
time-indexed variables. This approach leads to very large models, but gives better lower …

This paper surveys algorithms for the problem of scheduling jobs on a single machine to
minimize total weighted tardiness. Special attention is given to two dynamic programming …

In the parallel machine scheduling problem with earliness and tardiness penalties
(PMSP_E/T) considered here, a set of independent jobs with sequence-dependent setups is …

This paper aims at presenting a compilation of state-of art references in which dynamic
programming (DP) and its variants have been applied as a solution methods for the …

A single machine scheduling problem with distinct due windows to minimize total weighted
earliness and tardiness is examined. A mathematical formulation of the problem is first …

A job scheduling problem with distinct due dates in a single machine is considered. General
penalty weights which are not necessarily proportional to the processing times are applied …