The following pages link to (Q3999415):
Displaying 20 items.
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544) (← links)
- Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling (Q875408) (← links)
- Solving makespan minimization problems with Lagrangean decomposition (Q1209146) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Cellular control of manufacturing systems (Q1309976) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- An alternative framework to Lagrangian relaxation approach for job shop scheduling. (Q1399595) (← links)
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling (Q1761167) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems (Q1906070) (← links)
- Dual decomposition of a single-machine scheduling problem (Q1906279) (← links)
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time (Q2499163) (← links)
- Near-optimal solutions of large-scale single-machine scheduling problems (Q2890466) (← links)
- A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates (Q3102810) (← links)
- (Q3348687) (← links)
- A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time (Q3737197) (← links)
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling (Q3802870) (← links)
- Simultaneous Resource Scheduling to Minimize Weighted Flow Times (Q3830804) (← links)
- A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling (Q4398900) (← links)
- Improving branch and bound for jobshop scheduling with constraint propagation (Q6567676) (← links)
