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

Authors:
Shao Chin Sung;Milan Vlach
Affiliations:
Department of Industrial and Systems Engineering, College of Science and Engineering, Aoyama Gakuin University, Sagamihara City, Kanagawa, Japan 229-8551;Aff2 Aff3
Venue:
Journal of Scheduling
Year:
2005

Citing 3
Cited 7

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

Computers and Operations Research
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)

Sensor-mission assignment in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Assigning sensors to missions with demands

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
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
Adaptive negotiation in managing wireless sensor networks

PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Interval selection with machine-dependent intervals

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
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

We are concerned with problems of scheduling jobs non-preemptively with the objective to maximize the weighted number of jobs that are completed exactly at their due dates. It has been shown that the problems for single machine and identical parallel machines are polynomial time solvable. The purpose of this paper is to establish the complexity status of the problem for unrelated parallel machine, which was left open. First, we present a polynomial time algorithm for solving the problem when the number of machine is fixed. Second, we show that when the number of machine is a part of input, the problem becomes NP-hard in the strong sense.