✦ LIBER ✦

Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

✍ Scribed by Jack A.A. van der Veen; Shuzhong Zhang

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 691 KB
Volume: 23
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(96)00016-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for preemptive scheduling of

Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times

✍ V. Reddy Dondeti; Hamilton Emmons 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 937 KB

A genetic algorithm for job sequencing p

A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

✍ C.Y. Lee; J.Y. Choi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 749 KB

Polynomial time algorithms for minimizin

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t

The complexity of machine scheduling for

The complexity of machine scheduling for stability with a single disrupted job

✍ Roel Leus; Willy Herroelen 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A branch and bound algorithm for single

A branch and bound algorithm for single machine scheduling with deteriorating values of jobs

✍ Theodore G. Voutsinas; Costas P. Pappis 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the

A CAT algorithm for generating permutati

A CAT algorithm for generating permutations with a fixed number of inversions

✍ Scott Effler; Frank Ruskey 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We develop a constant amortized time (CAT) algorithm for generating permutations with a given number of inversions. We also develop an algorithm for the generation of permutations with given index.