Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
type: Item
instance of: scholarly article
title: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
zbMATH Open document ID: 0535.90045
DOI: 10.1016/0377-2217(84)90105-X
published in: European Journal of Operational Research
publication date: 1984-01-01T00:00:00Z
review text: The author considers a scheduling problem involving independent preemptable jobs, unrelated parallel machines, renewable resources (such as labor), and one nonrenewable resource (such as capital) that becomes available over time. There are two optimality criteria: makespan and total costs. A two-stage algorithm is developed. First, parametric linear programming yields a compromise between both criteria. Next, a feasible schedule is constructed in polynomial time. It is also shown that minimizing the number of preemptions is equivalent to a traveling salesman problem.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3850804
zbMATH Keywords: financial constraints
zbMATH Keywords: independent preemptable jobs
zbMATH Keywords: unrelated parallel machines
zbMATH Keywords: renewable resources
zbMATH Keywords: one nonrenewable resource
zbMATH Keywords: makespan
zbMATH Keywords: total costs
zbMATH Keywords: two-stage algorithm
zbMATH Keywords: parametric linear programming
zbMATH Keywords: polynomial time
zbMATH Keywords: traveling salesman
author: Roman Słowiński
MaRDI profile type: Publication
cites work: Scheduling subject to nonrenewable-resource constraints
cites work: Q4166568
cites work: Q3050157
cites work: Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
cites work: Q3911382
cites work: Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
cites work: Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
cites work: Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
cites work: Q3883482
full work available at URL: 0377-2217(84)90105-x
OpenAlex ID: W2091951427
description: scientific article; zbMATH DE number 3850804