The research proposes a two-phase matching-based decoding scheme that will be incorporated into bi-objective simulated annealing (SA) to solve unrelated parallel machine scheduling problems (UPMSP). The two objectives are to maximize the satisfactions of makespan and average tardiness, in terms of fuzzy measure. The effectiveness of the decoding scheme is investigated using four simulated annea...

The work addresses the NP-hard problem of scheduling a set of jobs to unrelated parallel machines with the overall objective of minimizing makespan. The solution presented proposes a greedy constructive algorithm followed by an application of a Variable Neighborhood Decent strategy that continually improves the incumbent solution until a local optimum is reached. The strength of the approach li...

In order to utilize the distributed characteristic of sensors, distributed machine learning has become the mainstream approach, but the different computing capability of sensors and network delays greatly influence the accuracy and the convergence rate of the machine learning model. Our paper describes a reasonable parameter communication optimization strategy to balance the training overhead a...

The paper addresses the problem of maximizing the percentage of on-time jobs in a parallel machine environment with sequence dependent deterioration. The deterioration of each machine (and therefore of the job processing times) is a function of the sequence of jobs that have been processed by the machine. Two machine loading strategies are combined with a set of list scheduling algorithms to so...

The problem addressed in this paper is the non-preemptive unrelated parallel machine scheduling problem with the objective of minimizing the makespan. Machine-dependent and job sequence-dependent setup times are considered, all jobs are available at time zero, and all times are deterministic. This is a NP-hard problem and in this paper, optimal solutions are found for small problems only. For l...

Cross-lingual learning has become a popular approach to facilitate the development of resources and tools for low-density languages. Its underlying idea is to make use of existing tools and annotations in resource-rich languages to create similar tools and resources for resource-poor languages. Typically, this is achieved by either projecting annotations across parallel corpora, or by transferr...