Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm (Q955949)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm |
scientific article; zbMATH DE number 5372473
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm |
scientific article; zbMATH DE number 5372473 |
Statements
Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm (English)
0 references
24 November 2008
0 references
Summary: Modern automated production lines usually use one or multiple computer-controlled robots or hoists for material handling between workstations. A typical application of such lines is an automated electroplating line for processing printed circuit boards (PCBs). In these systems, cyclic production policy is widely used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a multihoist electroplating line with constant processing times. The objective is to minimize the cycle time, or equivalently to maximize the production throughput, for a given number of hoists. We propose a mathematical model and a polynomial algorithm for this scheduling problem. Computational results on randomly generated instances are reported.
0 references
0 references
0 references