Scheduling jobs with equal processing times subject to machine eligibility constraints

Authors:
Kangbok Lee;Joseph Y.-T. Leung;Michael L. Pinedo
Affiliations:
Department of Information, Operations & Management Sciences, Stern School of Business, New York University, New York, USA 10012-1126;Department of Computer Science, New Jersey Institute of Technology, Newark, USA 07102;Department of Information, Operations & Management Sciences, Stern School of Business, New York University, New York, USA 10012-1126
Venue:
Journal of Scheduling
Year:
2011

Citing 6
Cited 2

The competitiveness of on-line assignments

Journal of Algorithms
On-Line Load Balancing in a Hierarchical Server Topology

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

Journal of Scheduling
Note: On a parallel machine scheduling problem with equal processing times

Discrete Applied Mathematics
Scheduling unit length jobs with parallel nested machine processing set restrictions

Computers and Operations Research
An optimal rounding gives a better approximation for scheduling unrelated machines

Operations Research Letters

Scheduling unit length jobs on parallel machines with lookahead information

Journal of Scheduling
Approximations for the Two-Machine Cross-Docking Flow Shop Problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of nonpreemptively scheduling a set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a prespecified set of machines on which it can be processed, called its eligible set. We consider the most general case of machine eligibility constraints as well as special cases of nested and inclusive eligible sets. Both online and offline models are considered. For offline problems we develop optimal algorithms that run in polynomial time, while for online problems we focus on the development of optimal algorithms of a new and more elaborate structure as well as approximation algorithms with good competitive ratios.