Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
type: Item
instance of: scholarly article
title: Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
zbMATH Open document ID: 1152.78004
DOI: 10.1155/2008/364279
author: Ada Che
author: Chengbin Chu
published in: Mathematical Problems in Engineering
publication date: 2008-11-24T00:00:00Z
full work available at URL: https://eudml.org/doc/54910
review text: 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.
Mathematics Subject Classification ID: 78A55
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 60H25
Mathematics Subject Classification ID: 78M99
zbMATH DE Number: 5372473
MaRDI profile type: Publication
Wikidata QID: Q57185818
OpenAlex ID: W2045430093
cites work: Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
cites work: A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
cites work: Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
cites work: Sequencing and scheduling in robotic cells: recent developments
cites work: Minimizing the fleet size with dependent time-window and single-track constraints
cites work: Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions
cites work: Scheduling no-wait robotic cells with two and three machines
cites work: An improved algorithm for cyclic flowshop scheduling in a robotic cell
cites work: Minimal quantity of operators for serving a homogeneous linear technological process
cites work: Minimizing the number of robots to meet a given cyclic schedule
cites work: Cyclic scheduling in a robotic production line
cites work: An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
description: scientific article; zbMATH DE number 5372473