We present a novel framework to characterize the probability that an offered appointment with k-days' access delay will be booked and subsequently attended by a patient. We refer to this probability as the "probability of realization'" of an offered appointment, and demonstrate how empirical...

This research proposes two heuristics and a Genetic Algorithm (GA) to find non-dominated solutions to multiple-objective unrelated parallel machine scheduling problems. Three criteria are of interest, namely: makespan, total weighted completion time, and total weighted tardiness. Each heuristic...