Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments

DOI<link itemprop=identifier href="https://doi.org/10.1002/1099-1425(200101/02)4:1<53::AID-JOS59>3.0.CO;2-Y" /><53::AID-JOS59>3.0.CO;2-Y 10.1002/1099-1425(200101/02)4:1<53::AID-JOS59>3.0.CO;2-YzbMath0979.90053MaRDI QIDQ5932283

Peter Brucker, Wolfgang Brinkkötter

Publication date: 7 May 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundbenchmark problemsconstraint propagationJackson's preemptive schedulejob shop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (11)

A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling ⋮ Theoretical expectation versus practical performance of Jackson's heuristic ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ New single machine and job-shop scheduling problems with availability constraints ⋮ An advanced tabu search algorithm for the job shop problem ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ Scheduling and constraint propagation ⋮ Local adjustments: A general algorithm ⋮ Jackson's semi-preemptive scheduling on a single machine ⋮ Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures

Cites Work

• The job shop scheduling problem: Conventional and new solution techniques
• Benchmarks for shop scheduling problems
• A branch and bound algorithm for the job-shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• Deterministic job-shop scheduling: Past, present and future
• Benchmarks for basic scheduling problems
• A computational study of shifting bottleneck procedures for shop scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• A Computational Study of Local Search Algorithms for Job Shop Scheduling

This page was built for publication: Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments