Algorithms for Minimizing Resource Consumption Over Multiple Machines With a Common Due Window

Jen-Ya Wang

doi:10.1109/access.2019.2956551

Abstract

Algorithms for Minimizing Resource Consumption Over Multiple Machines With a Common Due Window

Highlights

Job scheduling has been studied in both industry and academia for long
BRANCH-AND-BOUND ALGORITHM To optimally solve the problem, we propose a branch-andbound algorithm for small problem instances
To evaluate the performance of imperialist competitive algorithm (ICA), the performance of genetic algorithm (GA) is viewed as a benchmark

Summary

Introduction

Job scheduling has been studied in both industry and academia for long. A good scheduling algorithm meets its corresponding objectives, e.g., minimum tardiness or maximum profit. Due to the advances in technology, traditional scheduling algorithms may not fit today’s environments. Parallel machines are commonly seen in many factories. All the jobs allocated to multiple machines should be considered as a whole. Scheduling each single machine by some traditional algorithms may not lead to the global maximum profit. New issues need to be reinvestigated and new scheduling algorithms are called for

Objectives

Results

Conclusion