Supporting Visual Exploration of Iterative Job Scheduling

We consider the general problem known as job shop scheduling, in which multiple jobs consist of sequential operations that need to be executed or served by appropriate machines having limited capacities. For example, train journeys (jobs) consist of moves and stops (operations) to be served by rail tracks and stations (machines). A schedule is an assignment of the job operations to machines and times where and when they will be executed. The developers of computational methods for job scheduling need tools enabling them to explore how their methods work. At a high level of generality, we define the system of pertinent exploration tasks and a combination of visualizations capable of supporting the tasks. We provide general descriptions of the purposes, contents, visual encoding, properties, and interactive facilities of the visualizations and illustrate them with images from an example implementation in air traffic management. We justify the design of the visualizations based on the tasks, principles of creating visualizations for pattern discovery, and scalability requirements. The outcomes of our research are sufficiently general to be of use in a variety of applications.

  • Published in:
    IEEE Computer Graphics and Applications
  • Type:
    Article
  • Authors:
    G. Andrienko, N. Andrienko, J. M. C. Garcia, D. Hecker, G. A. Vouros
  • Year:
    2022

Citation information

G. Andrienko, N. Andrienko, J. M. C. Garcia, D. Hecker, G. A. Vouros: Supporting Visual Exploration of Iterative Job Scheduling, IEEE Computer Graphics and Applications, 2022, 42, 3, 74-86, https://doi.org/10.1109/MCG.2022.3163437, Andrienko.etal.2022b,