Pages that link to "Item:Q4775690"
From MaRDI portal
The following pages link to Mathematical aspects of the 3 × n job-shop sequencing problem (Q4775690):
Displaying 8 items.
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← links)
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
- On three-machine flow shops with random job processing times (Q1580990) (← links)
- Non-bottleneck machines in three-machine flow shops (Q1585915) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison (Q3332755) (← links)
- Sequency on two and three machines with setup, processing and removal times separated (Q3664805) (← links)