Unrelated Parallel Machine Scheduling with Job and Machine Acceptance and Renewable Resource Allocation - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance Accéder directement au contenu
Article Dans Une Revue Algorithms Année : 2022

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

Résumé

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
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

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

Identifiants

Citer

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⟩
30 Consultations
64 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More