Jackson's semi-preemptive scheduling on a single machine (Q991363): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
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.1016/j.cor.2010.02.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071356367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit-time tasks with integer release times and deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum Promptness and Maximum Lateness on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with release times and tails / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for a single-machine scheduling problem with release times and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation schemes for scheduling problems with release dates and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with due-dates and early start times to minimize maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum lateness on one machine: computational experience and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search tree based approaches for parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block approach for single-machine scheduling with release dates and due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient ILP formulation for the single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs / rank
 
Normal rank

Latest revision as of 04:34, 3 July 2024

scientific article
Language Label Description Also known as
English
Jackson's semi-preemptive scheduling on a single machine
scientific article

    Statements

    Jackson's semi-preemptive scheduling on a single machine (English)
    0 references
    0 references
    0 references
    7 September 2010
    0 references
    0 references
    semi-preemptive scheduling
    0 references
    single machine
    0 references
    release dates
    0 references
    delivery times
    0 references
    makespan
    0 references
    adjustment procedures
    0 references
    lower bound
    0 references
    branch-and-bound
    0 references
    0 references
    0 references