This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...

in this paper, an efficient extension of network simplex algorithm is presented. in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by network simplex algorithm (nsa) and nsa+, which extended the stand...

In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...

Link scheduling in device-to-device (D2D) networks is usually formulated as a non-convex combinatorial problem, which generally NP-hard and difficult to get the optimal solution. Traditional methods solve this problem are mainly based on mathematical optimization techniques, where accurate channel state information (CSI), obtained through estimation feedback, needed. To overcome high computatio...

The construction industry has been suffering from delays and cost overruns for decades. Experienced schedulers programs allocate contingencies (both time) based on professional experiences gained knowledge. Such tacit knowledge not captured, stored, shared with inexperienced schedulers. This paper proposes a graph-based automated scheduling (GAS) method to capture, store, reuse the in schedules...