The following pages link to (Q3964287):
Displaying 35 items.
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
- On the asymptotic execution time of multi-tasked processes on tandem processors (Q582052) (← links)
- KBSS: A knowledge-based system for scheduling in automated manufacturing (Q583088) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- An improved constraint satisfaction adaptive neural network for job-shop scheduling (Q969749) (← links)
- Professor Richard Bellman: academician, scholar, practitioner and patron of fuzzy sets (Q1078159) (← links)
- The two-machine sequence dependent flowshop scheduling problem (Q1081528) (← links)
- Richard Bellman's contributions to computer science (Q1081590) (← links)
- A new integer programming formulation for the permutation flowshop problem (Q1121163) (← links)
- Scheduling with neural networks -- the case of the Hubble Space Telescope (Q1200817) (← links)
- On stationary tandem queueing networks with job feedback (Q1319165) (← links)
- On infinite queueing tandems (Q1337658) (← links)
- The three-machine flow-shop problem with arbitrary precedence relations (Q1342006) (← links)
- Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
- Nearest route problem (Q1584634) (← links)
- Applications of max-plus algebra to flow shop scheduling problems (Q1671348) (← links)
- On the optimality conditions of the two-machine flow shop problem (Q1754105) (← links)
- Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems (Q1761190) (← links)
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan (Q1787748) (← links)
- Analysis of the twisting department at superior cable corporation: A case study (Q1809862) (← links)
- On the role of bottleneck Monge matrices in combinatorial optimization (Q1904608) (← links)
- Asymptotic optimality of statistical multiplexing in pipelined processing (Q1908671) (← links)
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814) (← links)
- A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q2217032) (← links)
- Dynamic programming optimization in line of sight networks (Q2288208) (← links)
- Flowshop scheduling research after five decades (Q2572844) (← links)
- A new sufficient condition of optimality for the two-machine flowshop problem (Q2572845) (← links)
- Shortest and longest path problems (Q2785406) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- Design and scheduling of flexible assembly lines for printed circuit boards (Q4398942) (← links)
- A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems (Q4726075) (← links)
- Independent Sets in Restricted Line of Sight Networks (Q5056064) (← links)
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
- A new adaptive neural network and heuristics hybrid approach for job-shop scheduling (Q5945329) (← links)