𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of shop-scheduling problems with two or three jobs

✍ Scribed by Yu.N. Sotskov

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
553 KB
Volume
53
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Scheduling groups of jobs in the two-mac
Scheduling groups of jobs in the two-machine flow shop
✍ K.R Baker πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 618 KB

This paper provides a review of the two-machine flow shop model when time lags or setups are introduced. Building on these results, it establishes a general framework for scheduling groups of jobs when each group requires a setup.