Scheduling Parts in a Combined Production-transportation Work Cell

DOI10.1057/jors.1990.86zbMath0703.90047OpenAlexW1992329757MaRDI QIDQ3483069

Gad Vitner, Jelman I. Stern

Publication date: 1990

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1990.86

zbMATH Keywords

two-machine flowshopflexible manufacturing systemasymmetric travelling salesmantwo machines in seriesproduction-transportation scheduling problemrobotic transfer devicetwo-machine, automated manufacturing cell

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (max. 100)

Machine scheduling with job delivery coordination ⋮ Scheduling a two-machine robotic cell: A solvable case ⋮ Flowshop scheduling with interstage job transportation ⋮ Coordinating multi-location production and customer delivery ⋮ Realistic two-stage flowshop batch scheduling problems with transportation capacity and times ⋮ On-line scheduling in a surface treatment system ⋮ Hybrid flowshop scheduling with interstage job transportation ⋮ Algorithms for sequencing robot activities in a robot-centered parallel- processor workcell ⋮ Machine scheduling with transportation considerations ⋮ Machine scheduling with deliveries to multiple customer locations ⋮ Makespan minimization for flow-shop problems with transportation times and a single robot ⋮ Optimization of processing and delivery decisions involving third-party machines ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots ⋮ A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time

This page was built for publication: Scheduling Parts in a Combined Production-transportation Work Cell