A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
type: Item
instance of: scholarly article
title: A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
zbMATH Open document ID: 0813.90057
DOI: 10.1016/0377-2217(94)90127-9
author: V. Pereyra
published in: European Journal of Operational Research
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 709900
zbMATH Keywords: cyclic scheduling of transporters
zbMATH Keywords: branch-and-bound
zbMATH Keywords: time windows
zbMATH Keywords: material handling
zbMATH Keywords: minimal time span
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90127-9
OpenAlex ID: W2083808640
cites work: The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
description: scientific article; zbMATH DE number 709900