Pages that link to "Item:Q1273123"
From MaRDI portal
The following pages link to Parallel branch-and-bound methods for the job-shop scheduling problem (Q1273123):
Displaying 16 items.
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
- The job-shop problem and immediate selection (Q1339120) (← links)
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
- Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability (Q1578308) (← links)
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
- On single-walk parallelization of the job shop problem solving algorithms (Q1761161) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking (Q2627356) (← links)
- Parallel cooperative approaches for the labor constrained scheduling problem (Q2776558) (← links)
- A fine-grained parallel algorithm for the cyclic flexible job shop problem (Q4971705) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
- Fast parallel heuristics for the job shop scheduling problem (Q5955476) (← links)
