𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bicriterion scheduling problem in a job shop with parallel processors

✍ Scribed by Ahmed Abu Cenna; Mario T. Tabucanon

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
512 KB
Volume
25
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An agent-based parallel approach for the
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
✍ Leila Asadzadeh; Kamran Zamanifar πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 599 KB

The job shop scheduling problem is one of the most important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate s

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