Minimizing the fleet size with dependent time-window and single-track constraints
type: Item
instance of: scholarly article
title: Minimizing the fleet size with dependent time-window and single-track constraints
zbMATH Open document ID: 0790.90043
DOI: 10.1016/0167-6377(93)90101-L
author: V. Pereyra
published in: Operations Research Letters
publication date: 1994-06-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 527399
zbMATH Keywords: fleet size
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: single-track constraint
zbMATH Keywords: cyclic schedule
zbMATH Keywords: time window
MaRDI profile type: Publication
cites work: A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
cites work: Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
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 527399