𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Benchmarks for shop scheduling problems

✍ Scribed by Ebru Demirkol; Sanjay Mehta; Reha Uzsoy

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
468 KB
Volume
109
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The mixed shop scheduling problem
The mixed shop scheduling problem
✍ Teruo Masuda; Hiroaki Ishii; Toshio Nishida πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 540 KB
Approximation algorithms for shop schedu
Approximation algorithms for shop scheduling problems with minsum objective
✍ Maurice Queyranne; Maxim Sviridenko πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 166 KB

We consider a general class of multiprocessor shop scheduling problems, preemptive or non-preemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We

The complexity of cyclic shop scheduling
The complexity of cyclic shop scheduling problems
✍ Nicholas G. Hall; Tae-Eog Lee; Marc E. Posner πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 190 KB

We consider scheduling problems for shops in which a job set is manufactured repetitively. Jobs are scheduled to minimize the cycle time of the job set, which is equivalent to maximizing the throughput rate. We characterize the complexity of the scheduling problem for several types of job shops. Pol

Solving the open shop scheduling problem
Solving the open shop scheduling problem
✍ Ulrich Dorndorf; Erwin Pesch; ToΓ n Phan-Huy πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 128 KB

Only few exact solution methods are available for the open shop scheduling problem. We describe a branch-and-bound algorithm for solving this problem which performs better than other existing algorithms. The key to the e ciency of our algorithm lies in the following approach: instead of analysing an