Visopt shopfloor: going beyond traditional scheduling

Authors:
Roman Barták
Affiliations:
Charles University, Faculty of Mathematics and Physics, Institute for Theoretical Computer Science, Praha 1, Czech Republic
Venue:
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Year:
2002

Citing 7
Cited 0

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Scheduling alternative activities

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Scheduling Algorithms

Scheduling Algorithms
A Permutation-Based Approach for Solving the Job-ShopProblem

Constraints
Resource-Based vs. Task-Based Approaches for Scheduling Problems

ISMIS '96 Proceedings of the 9th International Symposium on Foundations of Intelligent Systems
Modelling Resource Transitions in Constraint-Based Scheduling

SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Visopt ShopFloor: On the Edge of Planning and Scheduling

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Visopt Shop Floor is a generic scheduling system for solving complex scheduling problems. It differentiates from traditional schedulers by offering some planning capabilities. In particular, the activities to achieve the goal are planned dynamically during scheduling. In the paper, we give a motivation for the integration of planning and scheduling and we describe how such integration is realised in the scheduling engine of the Visopt Shop Floor system.