Time-Indexed Formulations and the Total Weighted Tardiness Problem
From MaRDI portal
Publication:2900999
DOI10.1287/ijoc.1070.0225zbMath1243.90057OpenAlexW2162009963MaRDI QIDQ2900999
Louis-Philippe Bigras, Michel Gamache, Gilles Savard
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1070.0225
Related Items (20)
Layered graph approaches for combinatorial optimization problems ⋮ Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties ⋮ Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity ⋮ A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems ⋮ An improved decision support model for scheduling production in an engineer-to-order manufacturer ⋮ Column generation for extended formulations ⋮ A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching ⋮ Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems ⋮ The single machine weighted mean squared deviation problem ⋮ Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem ⋮ Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers ⋮ The vehicle routing problem with time windows and temporal dependencies
Uses Software
This page was built for publication: Time-Indexed Formulations and the Total Weighted Tardiness Problem
