Pages that link to "Item:Q2664303"
From MaRDI portal
The following pages link to Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303):
Displaying 7 items.
- \(N\)-NEH+ algorithm for solving permutation flow shop problems (Q2668738) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)
- Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing (Q6151475) (← links)
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing (Q6547128) (← links)
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)