Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
From MaRDI portal
Publication:955949
DOI10.1155/2008/364279zbMath1152.78004WikidataQ57185818 ScholiaQ57185818MaRDI QIDQ955949
Publication date: 24 November 2008
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/54910
90B35: Deterministic scheduling theory in operations research
60H25: Random operators and equations (aspects of stochastic analysis)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
78A55: Technical applications of optics and electromagnetic theory
78M99: Basic methods for problems in optics and electromagnetic theory
Related Items
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, Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots, 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
Cites Work
- Sequencing and scheduling in robotic cells: recent developments
- Minimal quantity of operators for serving a homogeneous linear technological process
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- Minimizing the fleet size with dependent time-window and single-track constraints
- Cyclic scheduling in a robotic production line
- Minimizing the number of robots to meet a given cyclic schedule
- Scheduling no-wait robotic cells with two and three machines
- A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
- Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions
- Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
- An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
