NDLI: Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times

Content Provider	Springer Nature Link
Author	Epstein, Leah Yatsiv, Ido
Copyright Year	2016
Abstract	We revisit the classic problem of preemptive scheduling on m uniformly related machines. In this problem, jobs can be arbitrarily split into parts, under the constraint that every job is processed completely, and that the parts of a job are not assigned to run in parallel on different machines. We study a new objective which is motivated by fairness, where the goal is to minimize the sum of the two maximal job completion times. We design a polynomial time algorithm for computing an optimal solution. The algorithm can act on any set of machine speeds and any set of input jobs. The algorithm has several cases, many of which are very different from algorithms for makespan minimization (algorithms that minimize the maximum completion time of any job), and from algorithms that minimize the total completion time of all jobs.
Starting Page	115
Ending Page	127
Page Count	13
File Format	PDF
ISSN	10946136
Journal	Journal of Scheduling
Volume Number	20
Issue Number	2
e-ISSN	10991425
Language	English
Publisher	Springer US
Publisher Date	2016-04-06
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Uniformly related machines Preemptive scheduling Makespan completion times Operation Research/Decision Theory Calculus of Variations and Optimal Control; Optimization Optimization Artificial Intelligence (incl. Robotics) Supply Chain Management
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Management Science and Operations Research Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

Optimal and online preemptive scheduling on uniformly related machines

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime

Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations

Lower bounds for online makespan minimization on a small number of related machines

A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines

Multipurpose machine scheduling with rejection and identical job processing times

A note on $${\mathbb {NP}}$$ -hardness of preemptive mean flow-time scheduling for parallel machines

High-multiplicity scheduling on one machine with forbidden start and completion times

Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times

Similar Documents

Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

Optimal and online preemptive scheduling on uniformly related machines

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime

Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations

Lower bounds for online makespan minimization on a small number of related machines

A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines

Multipurpose machine scheduling with rejection and identical job processing times

A note on $${\mathbb {NP}}$$ -hardness of preemptive mean flow-time scheduling for parallel machines

High-multiplicity scheduling on one machine with forbidden start and completion times

Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times