𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving a bicriterion scheduling problem

✍ Scribed by Luc N. Van Wassenhove; Ludo F. Gelders

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
880 KB
Volume
4
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Solving problems in production schedulin
Solving problems in production scheduling
✍ Robin Lane; Stephen Evans πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 1012 KB

Traditionally, production scheduling has been viewed as a problem-solving task that involves a single problem -generation of a suitable schedule. This paper presents an alternative model in which individual difficulties are viewed as problems, and the task is to maintain a suitable schedule by resol

Solving large scale crew scheduling prob
Solving large scale crew scheduling problems
✍ Hai D. Chu; Eric Gelman; Ellis L. Johnson πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 572 KB

The crew pairing problem is posed as a set partitioning zero-one integer program. Variables are generated as legal pairings meeting all work rules. Dual values obtained from solving successive large linear program relaxations are used to prune the search tree. In this paper we present a graph based