Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

Authors:
Kunihiko Hiraishi;Eugene Levner;Milan Vlach
Affiliations:
School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahi-dai, Tatsunokuchi, Ishikawa, Japan;Holon Institute of Technology, 52 Golomb Street, Holon, Israel;School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahi-dai, Tatsunokuchi, Ishikawa, Japan
Venue:
Computers and Operations Research
Year:
2002

Citing 4
Cited 8

Introduction to algorithms

Introduction to algorithms
Sequencing with earliness and tardiness penalties: a review

Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

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

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

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Maximizing the weighted number of just-in-time jobs in flow shop scheduling

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

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

Journal of Scheduling
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.01

Visualization

Abstract

We study the problem of nonpreemptively scheduling n jobs on m identical machines in parallel to maximize the weighted number of jobs that are completed exactly at their due dates. We show that this problem is solvable in polynomial time even if positive set-up times are allowed. Moreover, we show that if due date tolerances are permitted, then already the single-machine case is NP-hard even if all set-up times are zero and all weights are the same.