Pages that link to "Item:Q3157644"
From MaRDI portal
The following pages link to Minimising makespan in the two-machine flow-shop with release times (Q3157644):
Displaying 13 items.
- A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions (Q1011174) (← links)
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← links)
- Generalized pairwise interchanges and machine scheduling (Q1388824) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- Mirror scheduling problems with early work and late work criteria (Q2066692) (← links)
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (Q2464428) (← links)
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847) (← links)
- Outsourcing and scheduling for a two-machine flow shop with release times (Q5058745) (← links)
- Minimizing makespan on a two-machine re-entrant flowshop (Q5428997) (← links)
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← links)
- Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates (Q6094571) (← links)
