A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
type: Item
instance of: scholarly article
title: A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
zbMATH Open document ID: 0907.90183
DOI: 10.1016/S0305-0548(97)00033-6
author: Konstantin Kogan
author: Eugene Levner
published in: Computers \& Operations Research
publication date: 1998-09-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 1202714
zbMATH Keywords: \(n\)-job, two-machine, multi-robot flowshop scheduling
zbMATH Keywords: makespan
MaRDI profile type: Publication
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Scheduling a two-machine robotic cell: A solvable case
cites work: Scheduling Parts in a Combined Production-transportation Work Cell
cites work: TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS
cites work: An effective solution of the Bellman-Johnson problem on a tree-like network
cites work: Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects
cites work: Scheduling models and methods in optimal freight transportation planning
full work available at URL: s0305-0548(97)00033-6
OpenAlex ID: W2091823578
description: scientific article; zbMATH DE number 1202714