A binary-rounding heuristic for multi-period variable-task-duration assignment problems
type: Item
instance of: scholarly article
title: A binary-rounding heuristic for multi-period variable-task-duration assignment problems
zbMATH Open document ID: 0854.90098
DOI: 10.1016/0305-0548(95)00073-9
author: Janis L. Miller
author: Lori S. Franz
published in: Computers \& Operations Research
publication date: 1997-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 909738
zbMATH Keywords: multi-period assignment
zbMATH Keywords: multiple time periods
zbMATH Keywords: three-dimensional assignment
MaRDI profile type: Publication
full work available at URL: 0305-0548(95)00073-9
OpenAlex ID: W1999751861
cites work: Weighted Assignment Models and Their Application
cites work: The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
cites work: Algorithms for the Multi-Resource Generalized Assignment Problem
cites work: Q3802875
cites work: Resource-Constrained Assignment Scheduling
cites work: An introduction to timetabling
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
cites work: Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
cites work: A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
cites work: A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
cites work: Q4077727
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
Recommended article: A Goal Programming Approach For A Multi Period Task Assignment Problem
Recommended article: A hybrid heuristic to solve a task allocation problem
Recommended article: Q5286847
Recommended article: Heuristics for the multi-resource generalized assignment problem
Recommended article: A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
Recommended article: Heuristic and exact algorithms for the simultaneous assignment problem
Recommended article: Heuristics for multimode scheduling problems with dedicated resources
Recommended article: Heuristic for a new multiobjective scheduling problem
Recommended article: Heuristics for biquadratic assignment problems and their computational comparison
description: scientific article; zbMATH DE number 909738