zbMath0498.90018MaRDI QIDQ3964287
Ichiro Nabeshima, Augustine O. Esogbue, Richard Bellman
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Professor Richard Bellman: academician, scholar, practitioner and patron of fuzzy sets,
The two-machine sequence dependent flowshop scheduling problem,
Richard Bellman's contributions to computer science,
On infinite queueing tandems,
The three-machine flow-shop problem with arbitrary precedence relations,
Permutation-induced acyclic networks for the job shop scheduling problem,
Independent Sets in Restricted Line of Sight Networks,
On the role of bottleneck Monge matrices in combinatorial optimization,
Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times,
Asymptotic optimality of statistical multiplexing in pipelined processing,
A new integer programming formulation for the permutation flowshop problem,
Applications of max-plus algebra to flow shop scheduling problems,
An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines,
Resource-constrained project scheduling: A survey of recent developments.,
A state-of-the-art review of parallel-machine scheduling research,
A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times,
On the optimality conditions of the two-machine flow shop problem,
Scheduling with neural networks -- the case of the Hubble Space Telescope,
An effective new heuristic algorithm for solving permutation flow shop scheduling problem,
Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems,
An improved constraint satisfaction adaptive neural network for job-shop scheduling,
Design and scheduling of flexible assembly lines for printed circuit boards,
A new adaptive neural network and heuristics hybrid approach for job-shop scheduling,
Shortest and longest path problems,
On the asymptotic execution time of multi-tasked processes on tandem processors,
KBSS: A knowledge-based system for scheduling in automated manufacturing,
Re-entrant flowshop scheduling with learning considerations to minimize the makespan,
Dynamic programming optimization in line of sight networks,
Analysis of the twisting department at superior cable corporation: A case study,
A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems,
Approximation scheduling algorithms: a survey,
Nearest route problem,
Flowshop scheduling research after five decades,
A new sufficient condition of optimality for the two-machine flowshop problem,
On stationary tandem queueing networks with job feedback
