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, Malostranské nám. 25, 1118 00 Praha 1, Czech Republic;School of Information Science, Japan Advanced Institute of Science and Technology 1-1 Asahidai, Tatsunokuchi, Ishikawa 923-1292, Japan
Venue:
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Year:
2005

Citing 3
Cited 3

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

A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines

Journal of Intelligent Manufacturing
Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems

Journal of Scheduling
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times

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.