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

DOI10.1016/0305-0548(95)00073-9MaRDI QIDQ1919790zbMATH OpenOpenAlexFDO

Authors Janis L. Miller, Lori S. Franz

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

multi-period assignmentmultiple time periodsthree-dimensional assignment

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• A Goal Programming Approach For A Multi Period Task Assignment Problem
• A hybrid heuristic to solve a task allocation problem
• scientific article; zbMATH DE number 227414
• Heuristics for the multi-resource generalized assignment problem
• A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
• Heuristic and exact algorithms for the simultaneous assignment problem
• Heuristics for multimode scheduling problems with dedicated resources
• Heuristic for a new multiobjective scheduling problem
• Heuristics for biquadratic assignment problems and their computational comparison

Cites work

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

Cited in

(7)

• An LP-based algorithm for the data association problem in multitarget tracking.
• 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
• Complexity results for the basic residency scheduling problem
• A Goal Programming Approach For A Multi Period Task Assignment Problem
• A three-phase matheuristic algorithm for the multi-day task assignment problem
• Resource assignment with preference conditions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919790)