Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions

DOI10.1007/11841036_58zbMath1131.90366OpenAlexW1775057550MaRDI QIDQ5449568

Hoogeveen, J. A., J. M. van den Akker, J. W. van Kempen

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_58

zbMATH Keywords

linear programmingcolumn generationrelease datesprecedence constraintsparallel machine schedulingmaximum latenesstime-indexed formulationset covering formulationintermediate lower bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows ⋮ The home care crew scheduling problem: preference-based visit clustering and temporal dependencies ⋮ The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach ⋮ Optimization models for targeted offers in direct marketing: exact and heuristic algorithms ⋮ The vehicle routing problem with time windows and temporal dependencies

This page was built for publication: Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions