Scheduling under linear constraints (Q323163): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zhen-bo Wang / rank
Normal rank
 
Property / author
 
Property / author: Zhen-bo Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2211598476 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1510.08551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3268707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot sizing and scheduling -- survey and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5756177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Bilinear Problems Using MILP Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lotsizing and scheduling for production planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic scheduling problems I — General strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation in stochastic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine flow shop scheduling problem with controllable job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of results for sequencing problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling in Manufacturing and Services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3094957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank

Revision as of 16:16, 12 July 2024

scientific article
Language Label Description Also known as
English
Scheduling under linear constraints
scientific article

    Statements

    Scheduling under linear constraints (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    parallel machine scheduling
    0 references
    linear programming
    0 references
    computational complexity
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers