A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2015.0661 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2292895089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of algorithms for the single machine total weighted tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations and the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs of equal length: Complexity, facets and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickest Flows Over Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet assignment problem: Solving a large scale integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving continuous-time dynamic network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time indexed formulation of non-preemptive single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for single-machine scheduling without machine idle time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to single-machine scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relation of time indexed formulations of single machine scheduling problems to the node packing problem / rank
 
Normal rank

Latest revision as of 00:03, 12 July 2024

scientific article
Language Label Description Also known as
English
A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems
scientific article

    Statements

    A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2016
    0 references
    single machine scheduling
    0 references
    mixed-integer linear programming
    0 references
    time indexed formulations
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers