In 2001, Kevin Baker adapted the heuristic evaluation methodology to find usability problems in real-time, shared workspace groupware systems [1]. Real-time, shared workspace groupware systems support real-time collaboration between distance-separated people through a shared workspace – “a medium sized flat work surface where people collaborate by manipulating visible tools and task artefacts” ...

DEPTH (evaluation approach based on DEsign PaTterns & Heuristic criteria) is an approach for performing scenario-based heuristic usability evaluation for e-commerce sites. It is comprised of a preparatory and execution phase where specific steps are performed for evaluating the usability along three axis: usability comparison tests among similar e-commerce sites, expert / heuristic evaluation, ...

The evaluation of e-learning applications deserves special attention, and evaluators need effective methodologies and appropriate guidelines to perform their task. In this paper, we present a comparison of different techniques and describe the methodology of an experiment aimed to unveil strengths and weaknesses of Heuristic Evaluation, Direct Observation and SUE Inspection. The experiment was ...

We propose a novel way for extracting the strength of the semantic relationship between words from semi-structured sources, such as WordNet. Unlike existing approaches that only explore the structured information (e.g., the hypernym relationship in WordNet), we present a framework that allows us to utilize all available information, including natural text descriptions. Our approach constructs a...

On one hand, heuristic evaluation has been considered as a potential alternative for extensive user testing; on the other hand, some comparative studies showed that user testing could not be substituted by heuristic evaluation. In this basic usability study of some widely estimated electronic newspapers, we show that it is indeed the case, but moreover, that results from user testing can valida...

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...