Unrelated Parallel Machine Scheduling with Job and Machine Acceptance and Renewable Resource Allocation

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In this paper, an unrelated parallel machine scheduling problem with job (product) and machine acceptance and renewable resource constraints was considered. The main idea of this research was to establish a production facility without (or with minimum) investment in machinery, equipment, and location. This problem can be applied to many real problems. The objective was to maximize the net profit; that is, the total revenue minus the total cost, including fixed costs of jobs, job transportation costs, renting costs of machines, renting cost of resources, and transportation costs of resources. A mixed-integer linear programming (MILP) model and several heuristics (greedy, GRASP, and simulated annealing) are presented to solve the problem.

Cite

CITATION STYLE

APA

Olteanu, A. L., Sevaux, M., & Ziaee, M. (2022). Unrelated Parallel Machine Scheduling with Job and Machine Acceptance and Renewable Resource Allocation. Algorithms, 15(11). https://doi.org/10.3390/a15110433

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free