Theoretical expectation versus practical performance of Jackson's heuristic

DOI10.1155/2015/484671zbMath1394.90308OpenAlexW2104014624WikidataQ59118707 ScholiaQ59118707MaRDI QIDQ1665791

Lester Carballo, Nodari Vakhania, Dante Pérez

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/484671

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Theoretical and practical issues in single-machine scheduling with two job release and delivery times ⋮ Scheduling a single machine with primary and secondary objectives

Cites Work

• Unnamed Item
• Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
• A study of single-machine scheduling problem to maximize throughput
• Single-machine scheduling with release times and tails
• Parallel batch scheduling of equal-length jobs with release and due dates
• Improving the preemptive bound for the single machine dynamic maximum lateness problem
• Jackson's semi-preemptive scheduling on a single machine
• Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
• A block approach for single-machine scheduling with release dates and due dates
• The one-machine sequencing problem
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
• Parallel branch-and-bound methods for the job-shop scheduling problem
• Concurrent operations can be parallelized in scheduling multiprocessor job shop
• Branch less, cut more and minimize the number of late equal-length jobs on identical machines
• Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
• An Algorithm for Solving the Job-Shop Problem
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A better algorithm for sequencing with release and delivery times on identical machines
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
• On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/F_max) problem
• Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments

This page was built for publication: Theoretical expectation versus practical performance of Jackson's heuristic