Task-resource scheduling problem

A Gorbenko, V Popov - International Journal of Automation and …, 2012 - Springer
Cloud computing is a new and rapidly emerging computing paradigm where applications,
data and IT services are provided over the Internet. The task-resource management is the …

Neighborhood hybrid structure for discrete optimization problems

MA Cruz-Chávez, A Martínez-Oropeza… - 2010 IEEE …, 2010 - ieeexplore.ieee.org
In this paper a comparative analysis of a neighborhood structures group are presented,
including a hybrid structure, which arises of a combination of this set of structures. The …

Analysis and Solving SAT and MAX-SAT Problems Using an L-partition Approach

A Kolokolov, A Adelshin, D Yagofarova - Journal of Mathematical …, 2013 - Springer
In this paper, we study SAT and MAX-SAT using the integer linear programming models and
L-partition approach. This approach can be applied to analyze and solve many discrete …

An efficient sat algorithm for complex job-shop scheduling

H Huang, S Zhou - 2018 8th International Conference on …, 2018 - atlantis-press.com
The job-shop scheduling problem (JSSP) is a typical scheduling problem, which belongs to
NP-hard problem. This paper tries to solve the complex JSSP by translating it into Boolean …

A complex task scheduling scheme for big data platforms based on Boolean satisfiability problem

H Hong, L Khan, A Gbadebo… - … on Information Reuse …, 2018 - ieeexplore.ieee.org
In the big data processing systems, the amount of data is increasing. At the same time, the
real-time requirement of data processing and analysis is higher and higher. Therefore, it is …

Neighborhood Hybrid Structure for Minimum Spanning Tree Problem

BM Bahena, MA Cruz-Chávez… - 2012 IEEE Ninth …, 2012 - ieeexplore.ieee.org
An experimental analysis of five neighborhoods is presented. The analysis includes a hybrid
structure comprised of one random pair, two random pairs, three random pairs or four …

Relaxation of job shop scheduling problem using a bipartite graph

MA Cruz-Chávez, A Martínez-Oropeza… - 2010 IEEE …, 2010 - ieeexplore.ieee.org
This paper addresses the Job Shop Scheduling Problem (JSSP). Basic constraints are
established and it is modeled by a disjunctive graph. The model was mapped to Unrelated …

[PDF][PDF] Relajación del Problema de Calendarización de Trabajos en un Taller de Manufactura utilizando un Grafo Bipartita

MA Cruz-Chávez, A Martínez-Oropeza… - … en diversas áreas …, 2009 - gridmorelos.uaem.mx
En este artículo se aborda el problema de Calendarización de Máquinas en un Taller de
Manufactura. Se establecen las restricciones básicas y el modelado por medio de un grafo …