Scheduling problem with multi-purpose parallel machines

Authors:
Rosiane De Freitas Rodrigues;Mitre Costa Dourado;Jayme Luiz Szwarcfiter
Affiliations:
DCC/ICE, Federal University of Amazonas - UFAM, PESC/COPPE - UFRJ, 69077000, Brazil;IM, Federal University of Rio de Janeiro - UFRJ, Rio de Janeiro - RJ, Brazil;IM, COPPE and NCE, Federal University of Rio de Janeiro - UFRJ, Rio de Janeiro - RJ, Brazil
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 6
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Complexity of scheduling multiprocessor tasks with prespecified processor allocations

Discrete Applied Mathematics
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling Algorithms

Scheduling Algorithms
Scheduling jobs with equal processing times and time windows on identical parallel machines

Journal of Scheduling

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider a multi-purpose identical parallel machine scheduling problem, in which jobs should be executed on some machine belonging to a given subset of the set of machines. The problem is PMPM|r"j;p"j=1|@?w"jU"j, where there are n independent unit-time jobs, time window constraints, m identical parallel multi-purpose machines, and the objective is the minimization of the total weighted number of tardy jobs. The best previous complexity for this problem is O(n^2m(n+logm)), employing network flow techniques. We develop an algorithm that handles successive nesting of on-time jobs more efficiently, with O(n^3) overall time complexity.