×

Found 183 Documents (Results 1–100)

100
MathJax

Optimization of a recursive conveyor by reduction to a constraint satisfaction problem. (English. Russian original) Zbl 1481.90173

Autom. Remote Control 82, No. 11, 1892-1906 (2021); translation from Avtom. Telemekh. 2021, No. 11, 75-93 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Multiobjective particle swarm optimization with directional search for distributed permutation flow shop scheduling problem. (English) Zbl 07239979

Pan, Linqiang (ed.) et al., Bio-inspired computing: theories and applications. 14th international conference, BIC-TA 2019, Zhengzhou, China, November 22–25, 2019. Revised selected papers. Part I. Singapore: Springer. Commun. Comput. Inf. Sci. 1159, 164-176 (2020).
MSC:  68Q07
PDF BibTeX XML Cite
Full Text: DOI

Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks. (English) Zbl 1302.90085

Achterberg, Tobias (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23–27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21310-6/pbk). Lecture Notes in Computer Science 6697, 117-130 (2011).
MSC:  90B35 68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI Link

Worst case analysis of a new lower bound for flow shop weighted completion time problem. (English) Zbl 1175.90157

Dress, Andreas (ed.) et al., Combinatorial optimization and applications. First international conference, COCOA 2007, Xi’an, China, August 14–16, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73555-7/pbk). Lecture Notes in Computer Science 4616, 191-199 (2007).
MSC:  90B35 68W40
PDF BibTeX XML Cite
Full Text: DOI

A 3-approximation algorithm for movement minimization in conveyor flow shop processing. (English) Zbl 1003.90019

Sgall, Jiří(ed.) et al., Mathematical foundations of computer science 2001. 26th international symposium, MFCS 2001, Mariánské Lázně, Czech Republic, August 27-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2136, 363-374 (2001).
MSC:  90B35 90C59
PDF BibTeX XML Cite
Full Text: Link

Convergence analysis of simulated annealing-based algorithms solving flow shop scheduling problems. (English) Zbl 0959.68011

Bongiovanni, Giancarlo (ed.) et al., Algorithms and complexity. 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1767, 277-290 (2000).
MSC:  68M20 90B36
PDF BibTeX XML Cite

Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem. (English) Zbl 0962.68012

Reichel, Horst (ed.) et al., STACS 2000. 17th annual symposium on Theoretical aspects of computer science. Lille, France, February 17-19, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1770, 455-465 (2000).
MSC:  68M20 90B35
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software