A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines

Authors:
Ondřej Čepek;Shao Chin Sung
Affiliations:
Department of Theoretical Informatics and Mathematical Logic, Charles University, Czech Republic and Institute of Finance and Administration, VŠFS;School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa, Japan
Venue:
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Year:
2005

Citing 3
Cited 2

Introduction to algorithms

Introduction to algorithms
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

Computers and Operations Research

Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines

Journal of Scheduling
Maximizing the weighted number of just-in-time jobs in flow shop scheduling

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a scheduling problem on identical parallel machines, in which a processing time and a due date are given for each job, and the objective is to maximize the number of just-in-time jobs. A job is called just-in-time if it is completed exactly on its due date. We discuss the known results, show that a recently published greedy algorithm for this problem is incorrect, and present a new quadratic time algorithm which solves the problem.