Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 13 October 2020Accepted: 11 June 2021Published online: 29 November 2021KeywordsHamiltonian identification, operator reconstruction, quantum control problems, inverse greedy reconstruction algorithmAMS Subject Headings65K10, 81Q93, 34A55, 49N10, 49N45Publication DataISSN (...

Over the last decade many metaheuristics have been applied to the flowshop scheduling problem, ranging from Simulated Annealing or Tabu Search to complex hybrid techniques. Some of these methods provide excellent effectiveness and efficiency at the expense of being utterly complicated. In fact, several published methods require substantial implementation efforts, exploit problem specific speed-...

In this work, we introduce the Flowshop Scheduling Problem with Delivery Dates and Cumulative Payoffs. This problem is a variation of the flowshop scheduling problem with job release dates that maximizes the total payoff with a stepwise job objective function. This paper contributes towards proposing a mathematical formulation for this new problem and an original constructive heuristic. Additio...

A class of problems referred to as Order Independent Minimum Grouping Problems is examined and an intuitive hill-climbing method for solving such problems is proposed. Example applications of this generic method are made to two well-known problems belonging to this class: graph colouring and bin packing. Using a wide variety of different problem instance-types, these algorithms are compared to ...

The flowshop problem (FSP) is one of the most thoroughly studied scheduling problems. In the FSP, a set N = {1, . . . , n} of n independent jobs has to be processed on a set M = {1, . . . ,m} of m machines. Every job j, j ∈ N , requires a given fixed, non-negative processing time pij on every machine i, i ∈ M . In a flowshop, all n jobs are to be processed on the m machines in the same order, t...

We prove that all algebraic bases β allow an eventually periodic representation of the elements ℚ(β) with a finite alphabet digits $${\cal A}$$ . Moreover, classification allowing those representations have socalled weak greedy property is given. The decision problem whether given pair (β, ) allows proves to be rather hard, for it equivalent topological attractor iterated function system.