A heuristic scheduling algorithm for parallel machines job sorting with dynamic time window

Cargo and parcel loading and unloading in flight turnaround ground service is a multi-object parallel machines job sorting problem with time window and job shift time, its time window often be changed due to various reasons, machines service time is uncertain. Based on the analysis of features different form general manufacturing job sorting problems, a scheduling model of service is built, a new concept of Machine Capacity Difference is brought forward, a heuristic algorithm considered machine's ability difference is developed. It only needs to update one line or one row of data in judge matrix when time window or service time is changed while it doesn't impact executive efficiency of algorithm. Example shows that the algorithm is better than existed first-come-first-service and minimal remained workload scheduling combined algorithm, not only in reducing number of delay flights and delay time but also in balancing machines produce ability.