Minimizing Makespan in Flow Shop Scheduling Using a Network Approach
None
Saved in:
| Main Author: | |
|---|---|
| Format: | Book Chapter |
| Language: | English |
| Published: |
IntechOpen
2012
|
| Subjects: | |
| Online Access: | https://www.intechopen.com/chapters/25889 |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Minimizing Makespan in Flow Shop Scheduling Using a Network Approach
- Methodology To Develop Alternative Makespan Algorithm For Re-entrant Flow Shop Using Bottleneck Approach
- A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem
- Minimizing the makespan in job shop scheduling under conflict graph constraints
- Lot Processing in Hybrid Flow Shop Scheduling Problem
- Scheduling Methods for Hybrid Flow Shops with Setup Times
- Hybrid Job Shop and Parallel Machine Scheduling Problems: Minimization of Total Tardiness Criterion