Unrelated Parallel Machine Scheduling with Job and Machine Acceptance and Renewable Resource Allocation - Archive ouverte HAL Access content directly
Journal Articles Algorithms Year : 2022

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

(1, 2) , (2, 1) , (2, 1, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
algorithms-15-00433.pdf (325.56 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03859498 , version 1 (18-11-2022)

Identifiers

Cite

Alexandru-Liviu Olteanu, Marc Sevaux, Mohsen Ziaee. Unrelated Parallel Machine Scheduling with Job and Machine Acceptance and Renewable Resource Allocation. Algorithms, 2022, 15 (11), pp.433. ⟨10.3390/a15110433⟩. ⟨hal-03859498⟩
0 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More