Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Grasp Based Metaheuristic To Solve The Mixed Fleet E-Waste Collection Route Planning Problem, Aldy Gunawan, Dang V.A. Nguyen, Pham K.M. Nguyen, Pieter. Vansteenwegen Aug 2023

Grasp Based Metaheuristic To Solve The Mixed Fleet E-Waste Collection Route Planning Problem, Aldy Gunawan, Dang V.A. Nguyen, Pham K.M. Nguyen, Pieter. Vansteenwegen

Research Collection School Of Computing and Information Systems

The digital economy has brought significant advancements in electronic devices, increasing convenience and comfort in people’s lives. However, this progress has also led to a shorter life cycle for these devices due to rapid advancements in hardware and software technology. As a result, e-waste collection and recycling have become vital for protecting the environment and people’s health. From the operations research perspective, the e-waste collection problem can be modeled as the Heterogeneous Vehicle Routing Problem with Multiple Time Windows (HVRP-MTW). This study proposes a metaheuristic based on the Greedy Randomized Adaptive Search Procedure complemented by Path Relinking (GRASP-PR) to solve …


Bi-Objective Optimization For A Single Batch Processing Machine, Leena Omar Ghrayeb Jan 2020

Bi-Objective Optimization For A Single Batch Processing Machine, Leena Omar Ghrayeb

Graduate Research Theses & Dissertations

This research proposes a methodology for solving the problem of scheduling jobs with unequal ready times, unequal processing times, and unequal sizes on a single batch processing machine, with the objectives of minimizing makespan and maximum tardiness. Jobs must be placed into batches and scheduled on the machine such that both objectives are minimized, and machine capacity is not violated. The problem under study can be denoted as 1|p-batch, sj, rj| Cmax,Tmax. Based on a review of relevant literature, this problem has not been considered before.

The problem under study is NP-hard. Consequently, meta-heuristics such as Simulated Annealing (SA) and …