Mathematical programming formulations for machine scheduling: A survey (Q811337): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57387911, #quickstatements; #temporary_batch_1705760225394
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jacek Błażewicz / rank
Normal rank
 
Property / author
 
Property / author: Jan Weglarz / rank
Normal rank
 
Property / author
 
Property / author: Jacek Błażewicz / rank
 
Normal rank
Property / author
 
Property / author: Jan Weglarz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with staircase and piecewise linear resource availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching to Minimize Flow Times on One Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Mean Flow Time With Release Time and Deadline Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the one-machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate duality relaxation for job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Periodic Loading Problem: Formulation And Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Optimal Control of Resource Allocation in a Complex of Operations Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project Scheduling with Continuously-Divisible, Doubly Constrained Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3475118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling, Linear Programming and Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two-phase method for preemptive scheduling / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:22, 24 June 2024

scientific article
Language Label Description Also known as
English
Mathematical programming formulations for machine scheduling: A survey
scientific article

    Statements

    Mathematical programming formulations for machine scheduling: A survey (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    Machine scheduling
    0 references
    survey
    0 references
    classification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers