A multi-period machine assignment problem

DOI10.1016/j.ejor.2004.07.051zbMath1085.90026OpenAlexW1985587938MaRDI QIDQ2572247

Xinhui Zhang, Jonathan F. Bard

Publication date: 16 November 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.051

zbMATH Keywords

HeuristicsMachine schedulingTotal unimodularityMulti-period assignment problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (2)

Optimal design of line replaceable units ⋮ Scheduling manufacturing systems with blocking: a Petri net approach

Uses Software

• XPRESS
• Mosel

Cites Work

• Unnamed Item
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• Performance of the MOSA method for the bicriteria assignment problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Heuristic scheduling of parallel machines with sequence-dependent set-up times

This page was built for publication: A multi-period machine assignment problem