๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Scheduling batches on parallel machines with major and minor set-ups

โœ Scribed by Christopher S. Tang

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
776 KB
Volume
46
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling parallel machines with major
Scheduling parallel machines with major and minor setup times
โœ Wittrock, RobertJ. ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer ๐ŸŒ English โš– 706 KB

This article discusses the problem of scheduling a large set of parts on an FMS so as to minimize the total completion time. Here, the FMS consists of a set of parallel identical machines. Setup time is incurred whenever a machine switches from one type of part to another. The setup time may be larg

Parallel machine batching and scheduling
Parallel machine batching and scheduling with deadlines
โœ T. C. Edwin Cheng; Mikhail Y. Kovalyov ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer US ๐ŸŒ English โš– 137 KB ๐Ÿ‘ 1 views

In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated parallel machines. Each job j has a processing time and a deadline, the time at which the job must be completed. On each machine, jobs may be grouped to form batches containing continuously scheduled

Batch scheduling with deadlines on paral
Batch scheduling with deadlines on parallel machines: An NP-hard case
โœ Mikhail Y. Kovalyov; Yakov M. Shafransky ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 529 KB

The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. ( 1997) and Kovalyov and Shafransky ( 1994). A classification of computational complexities of special cases was provided only for the situation when all groups

On the approximate tradeoff for bicriter
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
โœ Eric Angel; Evripidis Bampis; Alexander Kononov ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 305 KB

We consider multiobjective scheduling problems, i.e. scheduling problems that are evaluated with respect to many cost criteria, and we are interested in determining a trade-o (Pareto curve) among these criteria. We study two types of bicriteria scheduling problems: single-machine batching problems a