𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Better Algorithm for an Ancient Scheduling Problem

✍ Scribed by David R. Karger; Steven J. Phillips; Eric Torng

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
280 KB
Volume
20
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A genetic algorithm methodology for comp
A genetic algorithm methodology for complex scheduling problems
✍ Bryan A. Norman; James C. Bean πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 79 KB πŸ‘ 2 views

This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration ty

A branch-and-price algorithm for a hiera
A branch-and-price algorithm for a hierarchical crew scheduling problem
✍ Diego B.C. Faneyte; Frits C.R. Spieksma; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 122 KB πŸ‘ 1 views

## Abstract We describe a real‐life problem arising at a crane rental company. This problem is a generalization of the basic crew scheduling problem given in Mingozzi et al. [18] and Beasley and Cao [6]. We formulate the problem as an integer programming problem and establish ties with the integer

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