Module org.cicirello.chips_n_salsa
Package org.cicirello.search.problems.scheduling
package org.cicirello.search.problems.scheduling
Package of classes and interfaces related to representing and solving scheduling problems, which
includes implementations of constructive heuristics for scheduling problems.

ClassDescriptionThis is an implementation of the Apparent Tardiness Cost (ATC) heuristic.This is an implementation of a variation of the Apparent Tardiness Cost (ATC) heuristic, with a simple adjustment for setup times for problems with sequencedependent setups.This is an implementation of the ATCS (Apparent Tardiness Cost with Setups) heuristic.This class represents and generates instances of a common duedate scheduling problem, in which all jobs have both an earliness weight and a tardiness weight, and share a common duedate.DynamicATCS is an implementation of a variation of the ATCS (Apparent Tardiness Cost with Setups) heuristic, which dynamically updates the average processing and setup times as it constructs the schedule.This is an implementation of the earliest due date heuristic.This class implements a constructive heuristic, known as EXPET, for scheduling problems involving minimizing the sum of weighted earliness plus weighted tardiness.This class implements a constructive heuristic, known as LINET, for scheduling problems involving minimizing the sum of weighted earliness plus weighted tardiness.Implements the common scheduling cost function known as makespan.Implements the scheduling cost function known as maximum flowtime (which we want to minimize).Implements the scheduling cost function known as maximum lateness, which we want to minimize.Implements the scheduling cost function known as maximum tardiness, which we want to minimize.This is an implementation of the minimum slack time (MST) heuristic.This is an implementation of Montagne's heuristic heuristic.This is an implementation of the shortest process time heuristic, adjusted to include setup time.This is an implementation of the shortest process time heuristic, adjusted to include setup time.This is an implementation of the shortest process time heuristic.Implement this interface to define a single machine scheduling problem.Classes that implement single machine scheduling problems should implement this interface to enable heuristic, etc to interact with the data that defines the jobs of the scheduling instance, such as the process times, setup times (if any), duedates, etc of the jobs.This heuristic is smallest normalized setup.This heuristic is the smallest setup first.This heuristic is the smallest setup first.This heuristic is smallest twojob setup.This is an implementation of the weighted COVERT heuristic.This is an implementation of a variation of the weighted COVERT heuristic, adjusted to account for setup times for problems with sequencedependent setups.This is an implementation of a variation of the weighted critical ratio heuristic.This is an implementation of a variation of the weighted critical ratio heuristic, adjusted to account for setup times for problems with sequencedependent setups.Implements the scheduling cost function known as weighted earliness plus weighted tardiness.Implements the scheduling cost function known as weighted flowtime.Implements the scheduling cost function known as weighted lateness.This is an implementation of the weighted longest process time heuristic.Implements the scheduling cost function known as weighted number of tardy jobs, which we want to minimize.This class implements a variation the weighted shortest process time heuristic, but adjusted to incorporate setups times for problems with sequencedependent setups.This class implements a variation the weighted shortest process time heuristic with nonzero heuristic values only for late jobs, but adjusted to incorporate setups times for problems with sequencedependent setups.This class implements a variation the weighted shortest process time heuristic, but adjusted to incorporate setups times for problems with sequencedependent setups.This is an implementation of the weighted shortest process time heuristic.This is an implementation of the weighted shortest process time heuristic.Implements the scheduling cost function known as weighted squared tardiness.This class provides a representation of, and means of generating, instances of single machine scheduling problems involving weights and due dates, but without release dates (i.e., all jobs are released at the start of the problem at time 0, thus, the term "static" in the class name).This class provides a representation of, and means of generating, instances of single machine scheduling problems involving weights, due dates, and sequencedependent setup times, but without release dates (i.e., all jobs are released at the start of the problem at time 0, thus, the term "static" in the class name).Implements the scheduling cost function known as weighted tardiness.