Pages that link to "Item:Q1388824"
From MaRDI portal
The following pages link to Generalized pairwise interchanges and machine scheduling (Q1388824):
Displayed 10 items.
- Scheduling with compressible and stochastic release dates (Q336364) (← links)
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem (Q1433664) (← links)
- Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling (Q1603328) (← links)
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times (Q4670675) (← links)
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds (Q5478829) (← links)