𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a pattern sequencing problem to minimize the maximum number of open stacks

✍ Scribed by Horacio Hideki Yanasse

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
714 KB
Volume
100
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

Consider a wood cutting setting where different panels have to be cut from large boards. Each cut panel size is put into a stack which remains opened until the last panel of that size is cut. The problem considered here deals with the sequencing of the patterns in order to minimize the maximum number of open stacks during the production run. A branch and bound method for solving this problem is presented which uses a greedy type scheme to select the next node to branch.

πŸ“œ SIMILAR VOLUMES

A hybrid algorithm for the one machine s
A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
✍ V. Srinivasan πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio

A note on the complexity of family sched
A note on the complexity of family scheduling to minimize the number of late jobs
✍ T. C. Edwin Cheng; Zhaohui Liu; Yakov M. Shafransky πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 65 KB πŸ‘ 2 views

The single-machine family scheduling problem of minimizing the number of late jobs has been known to be NP-hard, but whether it is NP-hard in the strong sense is cited as an open problem in several reviews. In this note, we prove that this problem is strongly NP-hard even if all set-up times and pro

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