Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
Random operators and equations (aspects of stochastic analysis) (60H25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Technical applications of optics and electromagnetic theory (78A55) Basic methods for problems in optics and electromagnetic theory (78M99) Deterministic scheduling theory in operations research (90B35)
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.
- Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
- A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
- An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
- Cyclic hoist scheduling in large real-life electroplating lines
- A solution for cyclic scheduling of multi-hoists without overlapping
- A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
- An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- Cyclic scheduling in a robotic production line
- Minimal quantity of operators for serving a homogeneous linear technological process
- Minimizing the fleet size with dependent time-window and single-track constraints
- Minimizing the number of robots to meet a given cyclic schedule
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
- Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions
- Scheduling no-wait robotic cells with two and three machines
- Sequencing and scheduling in robotic cells: recent developments
- Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
- Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
- A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
- Cyclic scheduling in robotic flowshops with bounded work-in-process levels
- Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
- A single machine carryover sequence-dependent group scheduling in PCB manufacturing
- A branch and bound algorithm for the cyclic job-shop problem with transportation
- An algorithm for hoist scheduling problems
- Multimodal processes rescheduling: cyclic steady states space approach
- A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
- A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
This page was built for publication: Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955949)
