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

Authors:
Peter Brucker;Svetlana A. Kravchenko
Affiliations:
Fachbereich Mathematik/Informatik, Universität Osnabrück, Osnabrück, Germany 49069;United Institute of Informatics Problems, Minsk, Belarus 220012
Venue:
Journal of Scheduling
Year:
2008

Citing 2
Cited 8

On the complexity of minimizing the number of late jobs in unit time open shop

Discrete Applied Mathematics
Scheduling equal-length jobs on identical parallel machines

Discrete Applied Mathematics

Finding total unimodularity in optimization problems solved by linear programs

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Scheduling with multiple servers

Automation and Remote Control
Scheduling jobs with equal processing times subject to machine eligibility constraints

Journal of Scheduling
Scheduling two agents on uniform parallel machines with makespan and cost functions

Journal of Scheduling
Parallel machine problems with equal processing times: a survey

Journal of Scheduling
CAD: an efficient data management and migration scheme across clouds for data-intensive scientific applications

Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria

Computers and Operations Research
Scheduling problem with multi-purpose parallel machines

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a linear programming approach to the problem of scheduling equal processing time jobs with release dates and deadlines on identical parallel machines. The known algorithm with complexity O(n 3log驴log驴n) of B. Simons schedules all the jobs while minimizing both the maximum completion time and the mean flow time. Our approach permits also to minimize the weighted sum of completion times and total tardiness in polynomial time for the problems without deadlines. The complexity status of these problems was open.