Includes bibliographical references (p. 16).Supported by the NSF. 84151517-ECS Supported by a Dean's Summer Fellowship form the College of Business of the Ohio State University.Paul Mireault, Rakesh Vohra and James B. Orlin
Abstract—We consider the problem of scheduling n identical jobs with unequal ready times on m paral-...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
AbstractWe study the nonpreemptive parallel machines scheduling problem where some of the machines a...
AbstractWe consider the makespan minimization parallel machine scheduling problem where each machine...
For a scheduling problem to minimize the makespan on three uniform parallel machines we present a pa...
AbstractThis paper is concerned with the problem of assigning n jobs with known processing times to ...
In parallel machine scheduling, we are given a set of jobs, together with a number of machines and o...
We consider scheduling jobs on multipurpose machines where jobs can be processed by a subset of the ...
We study a machine scheduling model in which job scheduling and machine maintenance activities have ...
AbstractLee provided a modified version of LPT algorithm to deal with the problem Parallel Machines ...
In this paper we characterize optimal schedules for scheduling problems with parallel machines and u...
AbstractWe consider parallel-machine scheduling problems in which the processing time of a job is a ...
AbstractWe study a machine scheduling model in which job scheduling and machine maintenance activiti...
AbstractQ||Cmax denotes the problem of scheduling n jobs on m machines of different speeds such that...
77 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980.This thesis addresses the prob...
Abstract—We consider the problem of scheduling n identical jobs with unequal ready times on m paral-...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
AbstractWe study the nonpreemptive parallel machines scheduling problem where some of the machines a...
AbstractWe consider the makespan minimization parallel machine scheduling problem where each machine...
For a scheduling problem to minimize the makespan on three uniform parallel machines we present a pa...
AbstractThis paper is concerned with the problem of assigning n jobs with known processing times to ...
In parallel machine scheduling, we are given a set of jobs, together with a number of machines and o...
We consider scheduling jobs on multipurpose machines where jobs can be processed by a subset of the ...
We study a machine scheduling model in which job scheduling and machine maintenance activities have ...
AbstractLee provided a modified version of LPT algorithm to deal with the problem Parallel Machines ...
In this paper we characterize optimal schedules for scheduling problems with parallel machines and u...
AbstractWe consider parallel-machine scheduling problems in which the processing time of a job is a ...
AbstractWe study a machine scheduling model in which job scheduling and machine maintenance activiti...
AbstractQ||Cmax denotes the problem of scheduling n jobs on m machines of different speeds such that...
77 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980.This thesis addresses the prob...
Abstract—We consider the problem of scheduling n identical jobs with unequal ready times on m paral-...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
AbstractWe study the nonpreemptive parallel machines scheduling problem where some of the machines a...