An Analysis of Robustness Approaches for the Airport Baggage Sorting Station Assignment Problem

Table 1

The constants for the model.

Constant	Description
	Denotes the number of BSSs.
	Denotes the number of flights.
	The total number of activities to be serviced by baggage service stations for a given flight , which also equates to the total number of sorting stations required to fully service flight , > 0.
	Denotes a BSS where BSS 0 represents the dummy sorting station to which flights are assigned, if they cannot be assigned to a real BSS, .
	Denotes a flight, .
	Denotes the required service time for flight (1 hour for short haul and 1.33 hours for long haul).
	Denotes the desired buffer time for flight —the time for which its BSS should be idle prior to this flight being serviced. is considered to be 15 minutes for short haul and 30 minutes for long haul flights.
	Denotes the end service time for flight .
	Denotes the target starting service time for flight ().
	Denotes the the base starting service time for flight ().