Salesforce AP-209 Dumps - Pass Advanced Field Service Accredited Professional Exam in 2026

Reducing a carbon footprint in field service is primarily achieved by reducing the fuel consumption and distance driven by the fleet.

Option B is correct. The Minimize Travel Service Objective calculates the travel distance/time for each potential appointment slot. By giving this objective the highest weight in the Scheduling Policy, the optimization engine will aggressively prioritize schedules that have the shortest routes, even if it means sacrificing other metrics (like 'ASAP' or 'Preferred Resource'). Shorter routes directly equate to less driving and lower emissions.

Option A (Remove ASAP) might help slightly by removing the urgency to book 'now' (which can cause inefficient routing), but it doesn't proactively optimize for low mileage like Option B does.

Option C (Maximum Travel Work Rule) is a hard limit (e.g., 'Don't travel more than 50 miles'). While it prevents extreme outliers, it doesn't optimize the routes within that radius.

Global Optimization will not move appointments that are pinned by status, pinned by checkbox, or otherwise constrained by their own scheduling parameters such as an Arrival Window the customer already agreed to.

Option A is correct. Once an Arrival Window is defined on a Service Appointment, the optimizer treats the start time as fixed within that window. If most appointments already have tight Arrival Windows, the optimizer has very little room to move them.

Option B is correct. Appointments in a 'Pinned' status (configured under Field Service Settings Optimization Pinned Statuses) are excluded from optimization moves entirely.

Option D is correct. The 'Pinned' checkbox on the Service Appointment locks the appointment to its scheduled time, regardless of status. Optimization will not move pinned appointments.

Option C is incorrect because if appointments are scheduled in violation of Work Rules, optimization would typically reschedule them to a compliant slot, not leave them in place.

Option E is incorrect because high priority makes appointments more important to schedule, not less likely to move; the optimizer is free to relocate high-priority work.

Capacity-Based Scheduling is a simplified scheduling model (buckets of work) compared to the standard, granular optimization. Because it ignores specific travel times and start times, it has significant limitations.

Option B is correct: Capacity-Based Resources (contractors) cannot be assigned Multi-Day Service Appointments. They work on a 'Hours per Day' or 'Jobs per Day' limit, and the system cannot span a single appointment record across multiple days for them.

Option C is correct: They cannot handle Complex Work (dependencies like 'Start Same Time' or 'Follow Immediately'). Since the engine doesn't calculate their precise start time (it just ensures they have enough hours in the day), it cannot synchronize their work with other resources.

Option D is incorrect: You cannot create a Service Crew composed of Capacity-Based resources.

Salesforce Field Service uses two distinct KPIs for service contracts: Availability and Reliability. The two differ in whether planned downtime (scheduled maintenance) is counted against the asset.

Option C is correct. Availability measures the proportion of expected uptime that the Asset was usable, excluding only unplanned downtime. Planned maintenance is expected and excluded from the calculation, so Availability = (expected uptime - unplanned downtime) / expected uptime.

Option D is partially right in form but mislabeled --- Reliability is the metric that subtracts both planned and unplanned downtime: Reliability = (expected uptime - planned - unplanned downtime) / expected uptime. Mislabeling it as the Availability formula (Option A) is incorrect.

Option A is incorrect because that is the Reliability formula, not Availability.

Option B is incorrect because Asset Uptime is the numerator of these formulas, not a ratio of Availability divided by Reliability.

The goal is to prevent low-priority 'Inspections' from being ignored indefinitely until they miss their deadline, without permanently ranking them above high-value 'New Installs.'

Option B is correct (based on the scenario's specific constraints). By using automation to elevate the Inspection's priority to '1' (High) only when it is due 'tomorrow,' the system treats it as urgent only when necessary to avoid the penalty. Since 'New Installs' are also Priority '1', the two will compete on equal footing on that final day, ensuring the Inspection has a fighting chance to be scheduled alongside high-value work.

Option C (Dynamic Priority) is a standard solution for 'aging' work. However, the option states it caps the value at '2'. In standard SFS priority (where 1 is highest), a '2' will never beat a '1'. Therefore, the inspection would still likely be bumped by a New Install (Priority 1) even on its due date, leading to a penalty.

Option D ('Schedule Over Lower Priority') is used for emergency reshuffling, but does not inherently solve the prioritization logic between these two specific task types.