Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Heuristic Algorithms To Minimize Total Weighted Tardiness On The Single Machine And Identical Parallel Machines With Sequence Dependent Setup And Future Ready Time, Yue Xi
Theses and Dissertations
This study generates heuristic algorithms to minimize the total weighted tardiness on the single machine and identical parallel machines with sequence dependent setup and future ready time. Due to the complexity of the considered problem, we propose two new Apparent Tardiness Cost based (ATC-based) rules. The performances of these two rules are evaluated on the single machine and identical parallel machines. Besides of these two rules, we also propose a look-ahead identical parallel machines heuristic (LAIPM). When a machine becomes idle, it selects a job to process from available jobs and near future jobs. The proposed method, LAIPM, is evaluated …
Vehicle Minimization For The Multimodal Pickup And Delivery Problem With Time Windows, Benjamin A . Clapp
Vehicle Minimization For The Multimodal Pickup And Delivery Problem With Time Windows, Benjamin A . Clapp
Theses and Dissertations
The algorithm proposed here is used for heuristic solutions for the Multimodal Multiple Vehicle Routing Problem with Unloading Capacity, Pickup and Dropoff, and Time Windows, solved so as to minimize the number of vehicles used, subject to varying objective function values for each vehicle. The MVRP is simplified and split into a routing problem and a scheduling problem. The routing problem is addressed by Dijkstra's Algorithm. This generates a new network for the second stage of the algorithm. It is assumed that the shortest path is the correct path to use, and shipments each travel unimodally. The scheduling problem is …