Pages that link to "Item:Q5575251"
From MaRDI portal
The following pages link to Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm (Q5575251):
Displaying 21 items.
- The project scheduling polyhedron: Dimension, facets and lifting theorems (Q2367366) (← links)
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems (Q2475846) (← links)
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches (Q2485332) (← links)
- A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem (Q2669530) (← links)
- Ant colony optimisation with parameterised search space for the job shop scheduling problem (Q3163736) (← links)
- An Exact Decomposition Approach for the Real-Time Train Dispatching Problem (Q3195230) (← links)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274) (← links)
- Bounds and initial solutions for frame ineration in machine scheduling (Q3835646) (← links)
- Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets (Q4230222) (← links)
- (Q4238569) (← links)
- The durations of<i>m</i>projects for achieving minimization of cost and optimal resource allocation (Q4299881) (← links)
- A dynamic job shop scheduling framework: a backward approach (Q4394248) (← links)
- A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling (Q4398900) (← links)
- Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← links)
- Dynamical Neural Network Approach to the Job-shop Scheduling (Q4846554) (← links)
- A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management (Q5129213) (← links)
- An tentative taboo search algorithm for job shop scheduling (Q5492513) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
- Improving branch and bound for jobshop scheduling with constraint propagation (Q6567676) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
- Two-stage stochastic/robust scheduling based on permutable operation groups (Q6596975) (← links)