Recommendations
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Adjustment of heads and tails for the job-shop problem
- An Algorithm for Solving the Job-Shop Problem
- Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
- scientific article; zbMATH DE number 3378735 (Why is no real title available?)
- On not-first/not-last conditions in disjunctive scheduling
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
- Solving various weighted matching problems with constraints
- Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
- The job-shop problem and immediate selection
- The one-machine sequencing problem
Cited in
(4)
This page was built for publication: Local adjustments: A general algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707084)