scientific article; zbMATH DE number 1305102
From MaRDI portal
Publication:4252045
Recommendations
Cited in
(16)- A manifesto for the computational method
- Two-machine routing open shop: How long is the optimal makespan?
- Cellular automata approach to scheduling problem in case of modifications of a program graph
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- The three-machine proportionate open shop and mixed shop minimum makespan problems
- A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- Irreducible bin packing and normality in routing open shop
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Linear time approximation scheme for the multiprocessor open shop problem
- The open shop scheduling problem
- scientific article; zbMATH DE number 7362744 (Why is no real title available?)
- An existence theorem for packing problems with implications for the computation of optimal machine schedules
- Some positive news on the proportionate open shop problem
- Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252045)
