On the potentially optimal solutions of classical shop scheduling problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7145128
- scientific article; zbMATH DE number 894720
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
- A brief review on the reducibility of shop sequences minimizing some regular objectives
- On the set of solutions of the open shop problem
Cited in
(4)- On the computational complexity of (maximum) shift class scheduling
- New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
- On algebraic characterizations in shop scheduling problems
- Necessary and sufficient conditions of optimality for some classical scheduling problems
This page was built for publication: On the potentially optimal solutions of classical shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517651)
