A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times

Kise, Hiroshi; Ibaraki, Toshihide; Mine, Hisashi

doi:10.1287/opre.26.1.121

Cited by 121 publications

(42 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In particular, when all jobs have the same (unit) weight and the same release time, non-preemptive real-time scheduling can be solved in O(n log n) time, using Moore's algorithm [18]. Also, when release times and due dates of jobs are ordered similarly (i.e., r i < r j ⇒ d i ≤ d j ), the problem is solvable in O(n 2 )-time using dynamic programming [15]. An improved O(n log n)-time algorithm was proposed by Lawler [16].…”

Section: Related Workmentioning

confidence: 99%

Real-Time k-bounded Preemptive Scheduling

Albagli-Kim

Schieber

Shachnai³

et al. 2015

2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)

View full text Add to dashboard Cite

We consider a variant of the classic real-time scheduling problem, which has natural applications in cloud computing. The input consists of a set of jobs, and an integer parameter k ≥ 1. Each job is associated with a processing time, a release time, a due-date and a positive weight. The goal is to feasibly schedule a subset of the jobs of maximum total weight on a single machine, such that each of the jobs is preempted at most k times.Our theoretical results for the real-time k-bounded preemptive scheduling problem include hardness proofs, as well as algorithms for subclasses of instances, for which we derive constant-ratio performance guarantees. We bridge the gap between theory and practice through a comprehensive experimental study, in which we also test the performance of several heuristics for general instances on multiple parallel machines. We use in the experiments a linear programming relaxation to upper bound the optimal solution for a given instance. Our results show that while k-bounded preemptive scheduling is hard to solve already on highly restricted instances, simple priority-based heuristics yield almost optimal schedules for realistic inputs and arbitrary values of k.

show abstract

Section: Related Workmentioning

confidence: 99%

Real-Time k-bounded Preemptive Scheduling

Albagli-Kim

Schieber

Shachnai³

et al. 2015

2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)

View full text Add to dashboard Cite

show abstract

“…Kise et al [13] showed that the problem can be solved in O(n 2 ) time provided that the release dates and due dates are compatible (that is, the jobs can be indexed so that r 1 ≤ r 2 ≤ …≤ r n and d 1 [15] proposed an O(n 5 ) dynamic programming algorithm for the pre-emptive case (1 | r i ,…”

Section: Previous Workmentioning

confidence: 99%

Heuristics for Minimizing the Number of Tardy Jobs on a Single Machine With Release Time

Oyetunji

Oluleye

2012

The South African Journal of Industrial Engineering

View full text Add to dashboard Cite

This paper considers the problem of minimizing the number of tardy jobs with release time on a single machine. Given that the problem has been classified as strongly NP-Hard, three heuristics (EOO, HR2, and HR3) are proposed for this problem. They are compared with a heuristic by Dauzere-Perez (selected from the literature). Randomly-generated problems ranging from 3 to 500 jobs are solved. Experimental results show that one of the proposed heuristics (EOO) outperforms other heuristics, both in terms of quality of solution (effectiveness) and speed of execution (efficiency). OPSOMMINGDie navorsing behandel die ministering van voltooiingstyd van die aantal draaltake by 'n enkele werktuig. As aanvaar word dat die problem geklassifiseer word as hoofsaaklike NP-hard, word voorgestel dat die vraagstuk bestudeer word deur gebruik te maak van drie heuristiese metodes (EOO, HR2, HR3). Die metodes word vergelyk ten opsigte van vertoning met die Dauzere-Perez-metode. Toevalsgegenereerde probleme wat strek vanaf 3 tot 500 draaltake word behandel. Die eksperimentele werk lewer bewys dat die EOO-metode ander metodes die loef afsteek ten opsigte van oplossingsgoedheid en -snelheid.

show abstract

“…, the same problem is solvable in O(n 2 ) with a dynamic programming algorithm in [16]. In VANET environment, if we do not consider any prioritized message/signature, we can adopt the algorithm in [16].…”

Section: E Batch Schedulingmentioning

confidence: 99%

“…In VANET environment, if we do not consider any prioritized message/signature, we can adopt the algorithm in [16].…”

Section: E Batch Schedulingmentioning

confidence: 99%

An Optimized Signature Verification System for Vehicle Ad Hoc NETwork

Mamun

Miyaji

2012

2012 8th International Conference on Wireless Communications, Networking and Mobile Computing

View full text Add to dashboard Cite

Abstract-This paper 1 presents an efficient approach to an existing batch verification system on Identity based group signature (IBGS) which can be applied to any Mobile ad hoc network device including Vehicle Ad hoc Networks (VANET). We propose an optimized way to batch signatures in order to get maximum throughput from a device in runtime environment. In addition, we minimize the number of pairing computations in batch verification proposed by B. Qin et al. for large scale VANET. We introduce a batch scheduling algorithm for batch verification targeting further minimization the batch computation time.

show abstract

A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times

Cited by 121 publications

References 3 publications

Real-Time k-bounded Preemptive Scheduling

Real-Time k-bounded Preemptive Scheduling

Heuristics for Minimizing the Number of Tardy Jobs on a Single Machine With Release Time

An Optimized Signature Verification System for Vehicle Ad Hoc NETwork

Contact Info

Product

Resources

About