The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

DOI10.1287/ijoc.1030.0034zbMath1239.90054OpenAlexW2107910046MaRDI QIDQ2890420

Francis Sourd

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/178d0d887406ad0be6d266ae1354ea0ec5e3e20f

zbMATH Keywords

branch and boundearliness and tardinesscontinuous linear programmingproduction-scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

Preemption in single machine earliness/tardiness scheduling, A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem, Fast neighborhood search for the single machine earliness-tardiness scheduling problem, Scheduling with earliness-tardiness penalties and parallel machines, Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, A recovering beam search algorithm for the single machine just-in-time scheduling problem, Earliness-tardiness scheduling with setup considerations, A new model for the preemptive earliness-tardiness scheduling problem, Multicriteria scheduling