✦ LIBER ✦

Lower bounds for the job-shop scheduling problem on multi-purpose machines

✍ Scribed by Bernd Jurisch

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 765 KB
Volume: 58
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)e0124-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new lower bound for the job-shop sched

A new lower bound for the job-shop scheduling problem

✍ Peter Brucker; Bernd Jurisch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 611 KB

The open shop scheduling problem with a

The open shop scheduling problem with a given sequence of jobs on one machine

✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

Genetic algorithms for the job-shop sche

Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence

✍ Fatima Ghedjati 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an

A polynomial-time algorithm for the two-

A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem

✍ Vadim G. Timkovsky 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

We consider a polynomial-time algorithm for the following scheduling problem: Given two machines, where each machine can process at most one job at a time; a set of jobs, where each job can start on or after its release date and consists of a chain of unit-time operations such that the machines have

On the solution of scheduling problems f

On the solution of scheduling problems for multi-purpose batch chemical plants

✍ W. Jänicke 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Lower Bounds for the Union–Find and the

Lower Bounds for the Union–Find and the Split–Find Problem on Pointer Machines

✍ Han La Poutré 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 490 KB

A well-known result of Tarjan states that for all n and m n there exists a sequence of n&1 Union and m Find operations that needs at least 0(m . :(m, n)) execution steps on a pointer machine that satisfies the separation condition. Later the bound was extended to 0(n+m. :(m, n)) for all m and n. In