A binary-rounding heuristic for multi-period variable-task-duration assignment problems

DOI10.1016/0305-0548(95)00073-9zbMath0854.90098OpenAlexW1999751861MaRDI QIDQ1919790

Lori S. Franz, Janis L. Miller

Publication date: 19 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00073-9

zbMATH Keywords

three-dimensional assignmentmultiple time periodsmulti-period assignment

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (5)

Task assignment with start time-dependent processing times for personnel at check-in counters ⋮ Minimizing average project team size given multi-skilled workers with heterogeneous skill levels ⋮ Resource assignment with preference conditions ⋮ Complexity results for the basic residency scheduling problem ⋮ An LP-based algorithm for the data association problem in multitarget tracking.

Cites Work

• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• Solving Large-Scale Zero-One Linear Programming Problems
• Resource-Constrained Assignment Scheduling
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Weighted Assignment Models and Their Application
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
• Algorithms for the Multi-Resource Generalized Assignment Problem
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods

This page was built for publication: A binary-rounding heuristic for multi-period variable-task-duration assignment problems