On Quantum Computing Formulations for the Total Weighted Tardiness and Total Weighted Earliness Optimization
摘要
In this paper, the use of D-wave quantum annealing for total weighted tardiness and total weighted earliness optimization problems is considered. The problems are defined and two formulations for each problem are proposed. The second formulation uses two’s complement approach to reduce the number of decision variables. Illustrative computer experiments using small OR-library-generated problem instances are provided. The experiments show the effectiveness of the proposed formulations and show that the alternative formulation can use fewer variables, but also causes a negative effect on the quality of solutions.