IEEE

Solving two-machine flow shop scheduling problem with total weighted number of on-time tasks maximization criterion on D-Wave quantum computer

Abstract: The work deals with the NP-hard problem of scheduling tasks on two machines with the sum-cost criterion. In this problem, each task must be performed sequentially on the first and then on ...
IEEE

Sequence-to-Sequence Stacked Gate Recurrent Unit Networks for Approximating the Forward Problem of Partial Differential Equations

Abstract: We proposed an optimisation algorithm based on the sequence-to-sequence (Seq2Seq) stacking of the gate recurrent unit (GRU) model to characterise and approximate the forward problem of ...