Time/Sequence-Dependent Scheduling: The design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm

In intelligent manufacturing, it is important to schedule orders from customers efficiently. Make-to-order companies may have to reject or postpone orders when the production capacity does not meet the demand. Many such real-world scheduling problems are characterised by processing times being dependent on the start time (time dependency) or...

Order Acceptance and Scheduling with Sequence-Dependent Setup Times: A New Memetic Algorithm and Benchmark of the State of the Art

The Order Acceptance and Scheduling (OAS) problem describes a class of real-world problems such as in smart manufacturing and satellite scheduling. This problem consists of simultaneously selecting a subset of orders to be processed as well as determining the associated schedule. A common generalization includes sequence-dependent setup times...