Local adjustments: A general algorithm

DOI10.1016/j.ejor.2003.11.020zbMath1132.90332OpenAlexW2072696875MaRDI QIDQ707084

David Rivreau, Laurent Peridy

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.11.020

zbMATH Keywords

Disjunctive schedulingEdge-findingElimination ruleJob shopTime-bound adjustments

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Strong polynomiality of resource constraint propagation

Cites Work

• Unnamed Item
• Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
• The one-machine sequencing problem
• The job-shop problem and immediate selection
• Adjustment of heads and tails for the job-shop problem
• On not-first/not-last conditions in disjunctive scheduling
• Solving various weighted matching problems with constraints
• A lattice-theoretical fixpoint theorem and its applications
• An Algorithm for Solving the Job-Shop Problem
• Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments

This page was built for publication: Local adjustments: A general algorithm