Better by Design ...

Today PCS Scheduling is helping to address the issues faced by all Mobile workforce organisations by cutting operational costs, adhering to stringent Service Level Agreements and delivering Customer satisfaction. 

The PCS core scheduling engine is built around an advanced 'Genetic Algorithm' (GA) engine that is capable of delivering unparalleled performance whilst handling a huge number of parameters and variables. The Genetic Algorithm approach out performs other popular scheduling algorithms (e.g. Simulated Annealing) and does not suffer quality or performance degradation when put under load.

The Genetic Algorithm method is capable of producing outstanding results when other algorithms fail miserably and can provide optimized results with extremely complex cost surfaces as is the case with scheduling problems.

Welcome to the world of Dynamic Scheduling

Optimised Mobile Workforces

PCSSchedule                           

Scheduling dynamically involves taking decisions regarding resource, capacity, availability, skills, geographic location, travel, parts requirements and other 'hard' constraints within a time frame of hours rather than days whilst adapting to operational events in real-time.

PCS Schedule is designed to work in real-world, highly dynamic environments and is capable of generating highly dynamic schedules covering a time frame of hours rather than days.

The complexity of Scheduling

“Scheduling is the allocation of resources and the sequencing of tasks to produce goods and services.”
The allocation of resources frequently involves conflicting objectives, for example reducing operating costs and achieving customer SLA's.
Scheduling dynamically involves taking decisions regarding resource capacity, availability, skills, geographic location, travel, parts requirements and other 'hard' constraints within a time frame of hours rather than days whilst adapting to operational events in real-time.
Dynamic scheduling is one of the most complex problems to solve.
It falls into a class of problems known as NP-Hard where the problem is not optimally solvable.
An optimal solution is 'non-deterministic in polynomial time'.
There no such thing as a perfect solution, only solutions that are acceptable- scheduling should produce good solutions in highly complex environments.

Dynamic Scheduling – The problem

Many 'dynamic scheduling' systems are modified appointment booking systems geared around a scheduling time window of 1-2 days.
PCS Schedule is designed to work in real-world, highly dynamic environments and is capable of generating highly dynamic schedules covering a time frame of hours rather than days.