L. He
5 records found
1
Authored
Single-machine scheduling where jobs have a penalty for being late or for being rejected altogether is an important (sub)problem in manufacturing, logistics, and satellite scheduling. It is known to be NP-hard in the strong sense, and there is no polynomial-time algorithm that ...
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 proce ...
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 schedu ...